Login / Signup

The complexity for partitioning graphs by monochromatic trees, cycles and paths.

Zemin JinXueliang Li
Published in: Int. J. Comput. Math. (2004)
Keyphrases
  • graph partitioning
  • graph matching
  • computational complexity
  • worst case
  • decision problems
  • graph theory
  • graph databases
  • graph theoretic
  • decision trees
  • shortest path
  • graph structure
  • polynomial time complexity