Shortest paths in directed planar graphs with negative lengths: a linear-space \(O(n\log^{2} n)\)-time algorithm (Q6486937)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6370641
- Shortest paths in directed planar graphs with negative lengths
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest paths in directed planar graphs with negative lengths: a linear-space \(O(n\log^{2} n)\)-time algorithm |
scientific article; zbMATH DE number 6370641 |
|
Statements
Shortest paths in directed planar graphs with negative lengths: a linear-space \(O(n\log^{2} n)\)-time algorithm (English)
0 references
Shortest paths in directed planar graphs with negative lengths (English)
0 references
18 November 2014
0 references
planar graphs
0 references
replacement paths
0 references
shortest paths
0 references
0.99985385
0 references
0.9221666
0 references
0.9034509
0 references
0.88257724
0 references
0.87236404
0 references
0.87236404
0 references
0.86771566
0 references
0.8677046
0 references
