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

Lily Chen Xueliang Li Huishu Lian

Published in: CoRR (2011)

Keyphrases

computational complexity
small number
undirected graph
case study
similarity measure
np complete
random walk
directed graph
directed acyclic graph
fixed number
maximum number