Faster shortest paths in dense distance graphs, with applications (Q1698725)
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 6839807
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster shortest paths in dense distance graphs, with applications |
scientific article; zbMATH DE number 6839807 |
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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8949533700942993
0 references
0.893643856048584
0 references
0.8872466683387756
0 references
0.8681952953338623
0 references
