Efficient heuristic algorithm for identifying critical nodes in planar networks
Year of publication: |
2019
|
---|---|
Authors: | Purevsuren, Dalaijargal ; Cui, Gang |
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. 106.2019, p. 143-153
|
Subject: | Critical node detection | Planar networks | Heuristics | NP-complete | Combinatorial optimization | Heuristik | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Netzwerk | Network | Graphentheorie | Graph theory |
-
Models and algorithms for network reduction
Li, Gang, (2015)
-
Local search for constrained graph clustering in biological networks
Tran, Duy Hoang, (2021)
-
Optimizing node infiltrations in complex networks by a local search based heuristic
Lozano, Manuel, (2019)
- More ...
-
Efficient Ordering Heuristics in Binary Decision Diagram–based Fault Tree Analysis
Mo, Yuchang, (2013)
-
Scalable Heuristic Algorithm for Identifying Critical Nodes in Networks
Purevsuren, Dalaijargal, (2023)
- More ...