Faster shortest paths in dense distance graphs, with applications (Q1698725): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:51, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster shortest paths in dense distance graphs, with applications |
scientific article |
Statements
Faster shortest paths in dense distance graphs, with applications (English)
0 references
16 February 2018
0 references
planar graphs
0 references
shortest paths
0 references
recursive \(r\)-divisions
0 references
dynamic range minimum queries
0 references
Monge heaps
0 references
