Login / Signup
Complexity of colouring problems restricted to unichord-free and { square, unichord }-free graphs.
Raphael C. S. Machado
Celina M. H. de Figueiredo
Nicolas Trotignon
Published in:
Discret. Appl. Math. (2014)
Keyphrases
</>
decision problems
data sets
data mining
data structure
optimization problems
bipartite graph
genetic algorithm
social networks
lower bound
multi objective
computational cost
np complete
computational issues
polynomial time complexity