On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms.

Kei Uchizawa Takanori Aoki Takehiro Ito Akira Suzuki Xiao Zhou

Published in: Algorithmica (2013)

Keyphrases

graph theory
worst case
computational complexity
orders of magnitude
learning algorithm
theoretical analysis
high computational complexity
data structure
computational cost
complexity measures
polynomial time complexity
significant improvement
np hard
connected components
lower complexity