Complexity of the critical node problem over trees (Q547128): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C39 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5916301 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
complexity | |||
Property / zbMATH Keywords: complexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
critical node problem | |||
Property / zbMATH Keywords: critical node problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
multicut in trees | |||
Property / zbMATH Keywords: multicut in trees / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
dynamic programming | |||
Property / zbMATH Keywords: dynamic programming / rank | |||
Normal rank |
Revision as of 11:41, 1 July 2023
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