Fast Algorithms for Shortest Paths in Planar Graphs, with Applications (Q3801095)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications |
scientific article; zbMATH DE number 4068317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast Algorithms for Shortest Paths in Planar Graphs, with Applications |
scientific article; zbMATH DE number 4068317 |
Statements
Fast Algorithms for Shortest Paths in Planar Graphs, with Applications (English)
0 references
1987
0 references
all pairs shortest paths
0 references
decision trees
0 references
heaps
0 references
planar separator
0 references
single source shortest paths
0 references
data structures
0 references
planar graphs
0 references
multicommodity flow
0 references
minimum cut
0 references
maximum flow
0 references
0.9333197474479676
0 references
0.9257422685623168
0 references
0.8949533700942993
0 references
0.8854747414588928
0 references
