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

• Type: Journal
• Year: 2010
• Where: FOCS
• Authors: Oren Weimann, Raphael Yuster
• Keywords: FOCS 2010, Matrix Multiplication, Shortest Paths, Shortest S-to-t Path, Theoretical Computer Science