Work

Multiple Source Replacement Path Problem

Year: 2020

Type: conference-paper

Abstract: One of the classical line of work in graph algorithms has been the Replacement Path Problem: given a graph G, s and t, find shortest paths from s to t avoiding each edge e on the shortest path from s to t. These paths are called replacement paths in literature. For an undirected and unweighted graph, (Malik, Mittal, and Gupta, Operation Research Letters, 1989) and (Hershberger and Suri, FOCS 2001) designed an algorithm that solves the replacement path problem in Õ (m + n) time1. It is natural to ask whether we can generalize the replacement path problem: can we find all replacement paths from a source s to all vertices in G? This problem is called the Single Source Replacement Path Problem.

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/3382734.3405714

Authors: Manoj Gupta, Rahul Jain, Nitiksha Modi

Institutions: Indian Institute of Technology Gandhinagar, Goldman Sachs (United States)

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W3026114479

FWCI: 1.303

Cites: 38

Cited by: 9

Related to: 10