Efficient heuristic algorithm for identifying critical nodes in planar networks (Q1734834)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient heuristic algorithm for identifying critical nodes in planar networks |
scientific article; zbMATH DE number 7043527
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient heuristic algorithm for identifying critical nodes in planar networks |
scientific article; zbMATH DE number 7043527 |
Statements
Efficient heuristic algorithm for identifying critical nodes in planar networks (English)
0 references
27 March 2019
0 references
critical node detection
0 references
planar networks
0 references
heuristics
0 references
NP-complete
0 references
combinatorial optimization
0 references
