``Global'' graph problems tend to be intractable (Q1820581)
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 3997165
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ``Global'' graph problems tend to be intractable |
scientific article; zbMATH DE number 3997165 |
Statements
``Global'' graph problems tend to be intractable (English)
0 references
1986
0 references
measure of globality
0 references
information-flow complexity
0 references
intractable problems
0 references
vertex cover
0 references
graph 3-colorability
0 references
Hamiltonian circuit
0 references
NP-complete problems
0 references
edge cover
0 references
graph 2-colorability
0 references
Eulerian circuit
0 references
problems in P
0 references
0.8709217
0 references
0.8531065
0 references
0.85310644
0 references
0 references
0.8462894
0 references
0.8442441
0 references
0.8425942
0 references
0.84060144
0 references
