Shortest paths in directed planar graphs with negative lengths: a linear-space \(O(n \log^2 n)\)-time algorithm (Q4633831)
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 7051191
| 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 7051191 |
Statements
6 May 2019
0 references
0.995580792427063
0 references
0.9355645775794984
0 references
0.9015568494796752
0 references
0.8833316564559937
0 references
0.883188009262085
0 references
