The weighted integrity problem is polynomial for interval graphs (Q3428636)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The weighted integrity problem is polynomial for interval graphs |
scientific article; zbMATH DE number 5138344
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The weighted integrity problem is polynomial for interval graphs |
scientific article; zbMATH DE number 5138344 |
Statements
29 March 2007
0 references
graph algorithm
0 references
interval graph
0 references
computational complexity
0 references
graph vulnerability
0 references
0.857322633266449
0 references
0.7744888663291931
0 references
