A preliminary analysis of the distance based critical node problem

DOI10.1016/J.ENDM.2016.10.007zbMath1356.05030OpenAlexW2550848430MaRDI QIDQ510911

Pierre Hosteins, Roberto Aringhieri, Andrea Grosso, Rosario Scatamacchia

Publication date: 14 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.10.007

zbMATH Keywords

shortest pathscritical node problemgraph fragmentation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (4)

Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem ⋮ A fast tri-individual memetic search approach for the distance-based critical node problem ⋮ The critical node detection problem in networks: a survey ⋮ A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs

Cites Work

• Hybrid constructive heuristics for the critical node problem
• A genetic algorithm for a class of critical node problems
• Detecting critical nodes in sparse graphs
• A faster algorithm for betweenness centrality*
• Experimental analysis of dynamic all pairs shortest path algorithms

This page was built for publication: A preliminary analysis of the distance based critical node problem