Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth (Q2444525): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q189398 |
Changed an Item |
||
| Property / author | |||
| Property / author: Andrea Grosso / rank | |||
Normal rank | |||
Revision as of 16:20, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth |
scientific article |
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
