Detecting critical nodes in sparse graphs (Q1013394)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5544741
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detecting critical nodes in sparse graphs |
scientific article; zbMATH DE number 5544741 |
Statements
Detecting critical nodes in sparse graphs (English)
0 references
17 April 2009
0 references
critical node detection
0 references
heuristics
0 references
integer linear programming
0 references
NP-complete
0 references
combinatorial optimization
0 references
0 references
0 references
0.8250969648361206
0 references
0.8211041688919067
0 references
0.8184139728546143
0 references
0.817808210849762
0 references
