Complexity of the critical node problem over trees (Q547128): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2011.02.016 / rank | |||
| Property / cites work | |||
| Property / cites work: Detecting critical nodes in sparse graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Identifying sets of key players in a social network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The wireless network jamming problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Primal-dual approximation algorithms for integral flow and multicut in trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4237089 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Epidemic dynamics on complex networks / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2011.02.016 / rank | |||
Normal rank | |||
Latest revision as of 21:06, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of the critical node problem over trees |
scientific article |
Statements
Complexity of the critical node problem over trees (English)
0 references
30 June 2011
0 references
complexity
0 references
critical node problem
0 references
multicut in trees
0 references
dynamic programming
0 references
