Login / Signup
The Complexity of Colouring Problems on Dense Graphs.
Keith Edwards
Published in:
Theor. Comput. Sci. (1986)
Keyphrases
</>
decision problems
np hardness
case study
computational cost
application domains
problems involving
optimization problems
np complete
random walk
polynomial time complexity