Longkun Guo, Hong Shen. Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs. In Mikhail J. Atallah, Xiang-Yang Li, Binhai Zhu, editors, Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011. Proceedings. Volume 6681 of Lecture Notes in Computer Science, pages 300-307, Springer, 2011. [doi]
@inproceedings{GuoS11-1,
title = {Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs},
author = {Longkun Guo and Hong Shen},
year = {2011},
doi = {10.1007/978-3-642-21204-8_32},
url = {http://dx.doi.org/10.1007/978-3-642-21204-8_32},
researchr = {https://researchr.org/publication/GuoS11-1},
cites = {0},
citedby = {0},
pages = {300-307},
booktitle = {Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011. Proceedings},
editor = {Mikhail J. Atallah and Xiang-Yang Li and Binhai Zhu},
volume = {6681},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-21203-1},
}