Computing replacement paths in surface embedded graphs

Jeff Erickson, Amir Nayyeri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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].

Original languageEnglish (US)
Title of host publicationProceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011
PublisherAssociation for Computing Machinery
Pages1347-1354
Number of pages8
ISBN (Print)9780898719932
DOIs
StatePublished - 2011

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Computing replacement paths in surface embedded graphs'. Together they form a unique fingerprint.

Cite this