@inproceedings{d117c9bc818744ccbab206c9d7b899a4,
title = "Finding arc and vertex-disjoint paths in networks",
abstract = "Multipath Routing plays an important role in communication networks. Multiple disjoint paths can increase the effective bandwidth between pairs of vertices, avoid congestion in a network and reduce the probability of dropped packets. In this paper, we built mathematical models for arc-disjoint paths problem and vertex-disjoint paths problem respectively, and then proposed polynomial algorithms for finding the shortest pair of arc and vertex-disjoint paths, both with the time complexity of O(m). Furthermore, we extend these algorithms to find any k disjoint paths in time O(km), whose sum-weight is minimized.",
keywords = "Arc-disjoint, Minimized, Multipath, Vertex-disjoint, Weight",
author = "Zheng Xie and Zhi Chen and Hongze Leng and Jun Zhang",
year = "2009",
doi = "10.1109/DASC.2009.75",
language = "English",
isbn = "9780769539294",
series = "8th IEEE International Symposium on Dependable, Autonomic and Secure Computing, DASC 2009",
pages = "539--544",
booktitle = "8th IEEE International Symposium on Dependable, Autonomic and Secure Computing, DASC 2009",
note = "8th IEEE International Symposium on Dependable, Autonomic and Secure Computing, DASC 2009 ; Conference date: 12-12-2009 Through 14-12-2009",
}