Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (Q4648696): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.20464 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1988680180 / rank | |||
Normal rank | |||
Revision as of 02:02, 20 March 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
