Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth (Q2444525)
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 6282250
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth |
scientific article; zbMATH DE number 6282250 |
Statements
Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth (English)
0 references
10 April 2014
0 references
critical node problem
0 references
treewidth
0 references
complexity
0 references
dynamic programming
0 references
0 references
0 references
0.8238732814788818
0 references
0.815658688545227
0 references
0.8104845285415649
0 references
0.8065268397331238
0 references
