Sciweavers

FOCS
2010
IEEE

Replacement Paths via Fast Matrix Multiplication

13 years 9 months ago
Replacement Paths via Fast Matrix Multiplication
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t path that avoids e. Apart from approximation algorithms and algorithms for special graph classes, the naive solution to this problem
Oren Weimann, Raphael Yuster
Added 11 Feb 2011
Updated 11 Feb 2011
Type Journal
Year 2010
Where FOCS
Authors Oren Weimann, Raphael Yuster
Comments (0)