Login / Signup
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
Elaine M. Eschen
Chính T. Hoàng
R. Sritharan
Lorna Stewart
Published in:
CoRR (2009)
Keyphrases
</>
directed graph
worst case
computational complexity
polynomial time complexity
space complexity
small number
color images
knowledge base
machine learning
case study
decision trees
website
graphical models
data mining
databases
query complexity
real time