Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth (Q2444525): 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.1016/j.dam.2013.03.021 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054950944 / rank | |||
Normal rank | |||
Revision as of 00:22, 20 March 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
