A near-linear-time algorithm for computing replacement paths in planar directed graphs (Q2930346)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A near-linear-time algorithm for computing replacement paths in planar directed graphs |
scientific article |
Statements
A near-linear-time algorithm for computing replacement paths in planar directed graphs (English)
0 references
18 November 2014
0 references
planar graphs
0 references
replacement paths
0 references
