Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic. Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing. In Alejandro López-Ortiz, Angèle M. Hamel, editors, Combinatorial and Algorithmic Aspects of Networking, First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers. Volume 3405 of Lecture Notes in Computer Science, pages 49-62, Springer, 2004. [doi]
@inproceedings{ErlebachHPV04,
title = {Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing},
author = {Thomas Erlebach and Alexander Hall and Alessandro Panconesi and Danica Vukadinovic},
year = {2004},
doi = {10.1007/11527954_6},
url = {http://dx.doi.org/10.1007/11527954_6},
tags = {routing},
researchr = {https://researchr.org/publication/ErlebachHPV04},
cites = {0},
citedby = {0},
pages = {49-62},
booktitle = {Combinatorial and Algorithmic Aspects of Networking, First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers},
editor = {Alejandro López-Ortiz and Angèle M. Hamel},
volume = {3405},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-27873-7},
}