Login / Signup
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems.
Tobias Riege
Jörg Rothe
Published in:
Electron. Colloquium Comput. Complex. (2006)
Keyphrases
</>
exact solution
small number
optimization problems
computational complexity
random walk
undirected graph
maximum number