On the complexity of multiple bondage in graphs (Q2333796)
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: On the complexity of multiple bondage in graphs |
scientific article; zbMATH DE number 7129472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of multiple bondage in graphs |
scientific article; zbMATH DE number 7129472 |
Statements
On the complexity of multiple bondage in graphs (English)
0 references
13 November 2019
0 references
bondage
0 references
\(p\)-bondage
0 references
\(p\)-total bondage
0 references
\(p\)-tuple bondage
0 references
double bondage
0 references
complexity
0 references
3-SAT
0 references
0.9338037371635436
0 references
0.866800844669342
0 references
0.8617955446243286
0 references
0.8350198268890381
0 references
