An efficiently solvable graph partition problem to which many problems are reducible (Q2365814)
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 222807
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficiently solvable graph partition problem to which many problems are reducible |
scientific article; zbMATH DE number 222807 |
Statements
An efficiently solvable graph partition problem to which many problems are reducible (English)
0 references
29 June 1993
0 references
2-colors graph partition
0 references
recognition problem
0 references
bipartite graphs
0 references
NLOGSPACE
0 references
parallel algorithms
0 references
2-CNFSAT
0 references
2-QBF Truth
0 references
0.7608602643013
0 references
0.7553107142448425
0 references
0.753071665763855
0 references
0.747999370098114
0 references
0.7466290593147278
0 references
