NP-hardness of multiple bondage in graphs (Q491093)
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: NP-hardness of multiple bondage in graphs |
scientific article; zbMATH DE number 6475048
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-hardness of multiple bondage in graphs |
scientific article; zbMATH DE number 6475048 |
Statements
NP-hardness of multiple bondage in graphs (English)
0 references
24 August 2015
0 references
domination
0 references
\(p\)-domination
0 references
bondage
0 references
non-isolating \(p\)-bondage
0 references
complexity
0 references
0.9585436
0 references
0 references
0 references
0.88484967
0 references
0.87943435
0 references
0.87632614
0 references
0 references
0 references
