Telikepalli Kavitha, Julián Mestre. Max-Coloring Paths: Tight Bounds and Extensions. In Yingfei Dong, Ding-Zhu Du, Oscar H. Ibarra, editors, Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings. Volume 5878 of Lecture Notes in Computer Science, pages 87-96, Springer, 2009. [doi]
@inproceedings{KavithaM09,
title = {Max-Coloring Paths: Tight Bounds and Extensions},
author = {Telikepalli Kavitha and Julián Mestre},
year = {2009},
doi = {10.1007/978-3-642-10631-6_11},
url = {http://dx.doi.org/10.1007/978-3-642-10631-6_11},
researchr = {https://researchr.org/publication/KavithaM09},
cites = {0},
citedby = {0},
pages = {87-96},
booktitle = {Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
editor = {Yingfei Dong and Ding-Zhu Du and Oscar H. Ibarra},
volume = {5878},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-10630-9},
}