Computing Replacement Paths in Surface Embedded Graphs (2011)
Cached
Download Links
by
Jeff Erickson
,
Amir Nayyeri
| Venue: | ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS |
BibTeX
@INPROCEEDINGS{Erickson11computingreplacement,
author = {Jeff Erickson and Amir Nayyeri},
title = {Computing Replacement Paths in Surface Embedded Graphs},
booktitle = {ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS},
year = {2011},
publisher = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Let s and t be vertices in a directed graph G with non-negative edge weights. The replacement paths problem asks us to compute, for each edge e in G, the length of the shortest path from s to t that does not traverse e. We describe an algorithm that solves the replacement paths problem for directed graphs embedded on a surface of any genus g in O(gn log n) time, generalizing a recent O(n log n)-time algorithm of Wulff-Nilsen for planar graphs [SODA 2010].
