``Global'' graph problems tend to be intractable (Q1820581): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0022-0000(86)90038-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2012734500 / rank | |||
Normal rank | |||
Revision as of 22:42, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ``Global'' graph problems tend to be intractable |
scientific article |
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
