| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777200 | Electronic Notes in Discrete Mathematics | 2016 | 4 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia,