Near Optimal Algorithms For The Single Source Replacement Paths Problem
Work
Year: 2019
Type: book-chapter
Abstract: The Single Source Replacement Paths (SSRP) problem is as follows; Given a graph G = (V, E), a source vertex s and a shortest paths tree Ts rooted in s, output for every vertex t ∊ V and for every edge... more
Authors Shiri Chechik, Sarel Cohen
Cites:
Cited by: 3
Related to: 10
FWCI: 0.405
Citation percentile (by year/subfield): 76.03
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze