Detecting critical nodes in sparse graphs
Year of publication: |
2009
|
---|---|
Authors: | Arulselvan, Ashwin ; Commander, Clayton W. ; Elefteriadou, Lily ; Pardalos, Panos M. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 36.2009, 7, p. 2193-2200
|
Subject: | Graphentheorie | Graph theory | Netzwerk | Network | Ganzzahlige Optimierung | Integer programming | Heuristik | Heuristics |
-
A derandomized approximation algorithm for the critical node detection problem
Ventresca, Mario, (2014)
-
Exact and heuristic algorithms for the design of hub networks with multiple lines
Martins de Sá, Elisangela, (2015)
-
Finding the most degree-central walks and paths in a graph : exact and heuristic approaches
Matsypura, Dmytro, (2023)
- More ...
-
Communication models for a cooperative network of autonomous agents
Arulselvan, Ashwin, (2009)
-
Complexity analysis for maximum flow problems with arc reversals
Rebennack, Steffen, (2010)
-
A combinatorial algorithm for the TDMA message scheduling problem
Commander, Clayton W., (2009)
- More ...