Login / Signup

Complexity of coloring graphs without paths and cycles.

Pavol HellShenwei Huang
Published in: Discret. Appl. Math. (2017)
Keyphrases
  • computational complexity
  • graph matching
  • graph theory
  • data sets
  • machine learning
  • worst case
  • shortest path
  • bipartite graph
  • weighted graph
  • small world