Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs (Q4648696)
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 6107806
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs |
scientific article; zbMATH DE number 6107806 |
Statements
Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (English)
0 references
15 November 2012
0 references
critical node problem
0 references
tree
0 references
series-parallel graph
0 references
dynamic programming
0 references
polynomial-time algorithm
0 references
0 references
0.8269613981246948
0 references
0.8151504993438721
0 references
0.8104845285415649
0 references
0.809623658657074
0 references
0.8061066269874573
0 references
