The algorithmic complexity of bondage and reinforcement problems in bipartite graphs (Q2447764)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6289933
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The algorithmic complexity of bondage and reinforcement problems in bipartite graphs |
scientific article; zbMATH DE number 6289933 |
Statements
The algorithmic complexity of bondage and reinforcement problems in bipartite graphs (English)
0 references
29 April 2014
0 references
complexity
0 references
NP-completeness
0 references
NP-hardness
0 references
domination
0 references
bondage
0 references
total bondage
0 references
reinforcement
0 references
total reinforcement
0 references
0 references
0.9222672581672668
0 references
0.8617955446243286
0 references
0.852798581123352
0 references
0.8304421305656433
0 references
