On the complexity of some problems related to graph extensions (Q650325)
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 some problems related to graph extensions |
scientific article; zbMATH DE number 5980705
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of some problems related to graph extensions |
scientific article; zbMATH DE number 5980705 |
Statements
On the complexity of some problems related to graph extensions (English)
0 references
25 November 2011
0 references
extension of graphs
0 references
vertex and edge \(k\)-extension
0 references
minimal \(k\)-extension
0 references
irreducible \(k\)-extension
0 references
exact \(k\)-extension
0 references
\(NP\) problem
0 references
\(NP\)-complete problem
0 references
fault tolerance
0 references
0.9207176
0 references
0.9186399
0 references
0.91027904
0 references
0 references
