We discuss how to develop efficient heuristics for the distance based critical node problem, that is the problem of deleting a subset of nodes from a graph G in such a way that the distance between each pair of nodes is as large as possible.
A preliminary analysis of the Distance Based Critical Node Problem
ARINGHIERI, ROBERTO;GROSSO, Andrea Cesare;HOSTEINS, Pierre;
2016-01-01
Abstract
We discuss how to develop efficient heuristics for the distance based critical node problem, that is the problem of deleting a subset of nodes from a graph G in such a way that the distance between each pair of nodes is as large as possible.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
2016-DCNP-CTW-ENDM.pdf
Accesso riservato
Descrizione: PDF editoriale
Tipo di file:
PDF EDITORIALE
Dimensione
156.27 kB
Formato
Adobe PDF
|
156.27 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
|
2016-DCNP-CTW-ENDM-postPrint.pdf
Open Access dal 18/11/2018
Descrizione: Post Print
Tipo di file:
POSTPRINT (VERSIONE FINALE DELL’AUTORE)
Dimensione
381.09 kB
Formato
Adobe PDF
|
381.09 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
