Go to the corresponding Portal 
Ananth, Prabhanjan ; Nasre, Meghana ; Sarpatwar, Kanthi K.
pdfformat: 

@InProceedings{ananth_et_al:LIPIcs:2011:3353, author = {Prabhanjan Ananth and Meghana Nasre and Kanthi K. Sarpatwar}, title = {{Rainbow Connectivity: Hardness and Tractability}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)}, pages = {241251}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897347}, ISSN = {18688969}, year = {2011}, volume = {13}, editor = {Supratik Chakraborty and Amit Kumar}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3353}, URN = {urn:nbn:de:0030drops33535}, doi = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2011.241}, annote = {Keywords: Computational Complexity, Rainbow Connectivity, Graph Theory, Fixed Parameter Tractable Algorithms} }
Keywords:  Computational Complexity, Rainbow Connectivity, Graph Theory, Fixed Parameter Tractable Algorithms  
Seminar:  IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)  
Issue Date:  2011  
Date of publication:  01.12.2011 