Archivio Istituzionale della RicercaWe 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; Hosteins, Pierre; Scatamacchia, Rosario. - In: ELECTRONIC NOTES IN DISCRETE MATHEMATICS. - ISSN 1571-0653. - ELETTRONICO. - 55:(2016), pp. 25-28. (Intervento presentato al convegno 14th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW16)) [10.1016/j.endm.2016.10.007].
A preliminary analysis of the Distance Based Critical Node Problem
SCATAMACCHIA, ROSARIO
2016
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.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2656884
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo