Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem (Q1634769)
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: Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem |
scientific article; zbMATH DE number 6994886
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem |
scientific article; zbMATH DE number 6994886 |
Statements
Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem (English)
0 references
18 December 2018
0 references
critical node problem
0 references
connectivity measure
0 references
shortest paths
0 references
dynamic programming
0 references
polynomial time algorithms
0 references
0 references
0 references
0.8151504993438721
0 references
0.793528139591217
0 references
0.7889309525489807
0 references
0.7864468693733215
0 references
0.7616719603538513
0 references
