TY - JOUR

T1 - Replacement paths and k simple shortest paths in unweighted directed graphs

AU - Roditty, Liam

AU - Zwick, Uri

PY - 2005

Y1 - 2005

N2 - Let G = (V, E) be a directed graph and let P be a shortest path from s to t in G. In the replacement paths problem we are required to find, for every edge e on P, a shortest path from s to t in G that avoids e. We present the first non-trivial algorithm for computing replacement paths in unweighted directed graphs (and in graphs with small integer weights). Our algorithm is Monte-Carlo and its running time is Õ(m√n). Using the improved algorithm for the replacement paths problem we get an improved algorithm for finding the k simple shortest paths between two given vertices.

AB - Let G = (V, E) be a directed graph and let P be a shortest path from s to t in G. In the replacement paths problem we are required to find, for every edge e on P, a shortest path from s to t in G that avoids e. We present the first non-trivial algorithm for computing replacement paths in unweighted directed graphs (and in graphs with small integer weights). Our algorithm is Monte-Carlo and its running time is Õ(m√n). Using the improved algorithm for the replacement paths problem we get an improved algorithm for finding the k simple shortest paths between two given vertices.

UR - http://www.scopus.com/inward/record.url?scp=26444461209&partnerID=8YFLogxK

U2 - 10.1007/11523468_21

DO - 10.1007/11523468_21

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:26444461209

SN - 0302-9743

VL - 3580

SP - 249

EP - 260

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - 32nd International Colloquium on Automata, Languages and Programming, ICALP 2005

Y2 - 11 July 2005 through 15 July 2005

ER -