Login / Signup
Deciding the On-line Chromatic Number of a Graph with Pre-Coloring is PSPACE-Complete.
Christian Kudahl
Published in:
CoRR (2014)
Keyphrases
</>
machine learning
relational databases
special case
np hard
structured data
directed graph
satisfiability problem