Login / Signup

Complexity of Coloring Graphs without Paths and Cycles.

Pavol HellShenwei Huang
Published in: LATIN (2014)
Keyphrases
  • worst case
  • graph representation
  • database
  • lower bound
  • graph matching
  • pattern recognition
  • computational complexity
  • object recognition
  • shortest path
  • graph theory