Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (Q4648696): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LAPACK / rank | |||
Normal rank | |||
Revision as of 03:09, 29 February 2024
scientific article; zbMATH DE number 6107806
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
