Name
Abstract | ||
|---|---|---|
We present a VNS algorithm for the Critical Node Problem, i.e., the maximal fragmentation of a graph through the deletion of k nodes. Two computational efficient neighbourhoods are proposed proving also their equivalence to the straightforward exchange of two nodes. The results of the proposed VNS algorithms outperform those currently available in literature. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.endm.2014.11.006 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Critical Node Problem,graph fragmentation | Discrete mathematics,Graph,Combinatorics,Equivalence (measure theory),Mathematics | Journal |
Volume | ISSN | Citations |
47 | 1571-0653 | 10 |
PageRank | References | Authors |
0.48 | 9 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. Aringhieri | 1 | 40 | 3.75 |
| Andrea Grosso | 2 | 450 | 28.55 |
| Pierre Hosteins | 3 | 50 | 5.14 |
| Rosario Scatamacchia | 4 | 58 | 7.66 |