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:
Discret. Math. (2011)
Keyphrases
</>
computational complexity
color images
space complexity
memory requirements
maximum number
data sets
clustering algorithm
search algorithm
pairwise
small number
decision problems
graph structure
fixed number
graph clustering
exponential size