A near-linear-time algorithm for computing replacement paths in planar directed graphs

DOI10.1145/1824777.1824784zbMath1300.68058OpenAlexW2992182984MaRDI QIDQ2930346

No author found.

Publication date: 18 November 2014

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1824777.1824784

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

Related Items (4)

Fault-tolerant distance labeling for planar graphs ⋮ Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles ⋮ Fault-tolerant distance labeling for planar graphs ⋮ Optimal shortest path set problem in undirected graphs

This page was built for publication: A near-linear-time algorithm for computing replacement paths in planar directed graphs