Login / Signup

Further hardness results on the rainbow vertex-connection number of graphs.

Lily ChenXueliang LiHuishu Lian
Published in: Theor. Comput. Sci. (2013)
Keyphrases
  • computational complexity
  • special case
  • undirected graph
  • image segmentation
  • small number
  • directed graph
  • graph matching