On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. Uchizawa, K., Aoki, T., Ito, T., Suzuki, A., & Zhou, X. Algorithmica, 67(2):161-179, 2013.
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms [link]Paper  bibtex   
@article{ dblp2205519,
  title = {On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms},
  author = {Kei Uchizawa and Takanori Aoki and Takehiro Ito and Akira Suzuki and Xiao Zhou},
  author_short = {Uchizawa, K. and Aoki, T. and Ito, T. and Suzuki, A. and Zhou, X.},
  bibtype = {article},
  type = {article},
  year = {2013},
  key = {dblp2205519},
  id = {dblp2205519},
  biburl = {http://www.dblp.org/rec/bibtex/journals/algorithmica/UchizawaAISZ13},
  url = {http://dx.doi.org/10.1007/s00453-012-9689-4},
  journal = {Algorithmica},
  pages = {161-179},
  number = {2},
  volume = {67},
  text = {Algorithmica 67(2):161-179 (2013)}
}

Downloads: 0