Login / Signup
Deciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-Complete.
Christian Kudahl
Published in:
CIAC (2015)
Keyphrases
</>
computational complexity
random walk
pspace complete
dynamic programming