Multiple-source shortest paths in embedded graphs (Q2862202)
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 6227051
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multiple-source shortest paths in embedded graphs |
scientific article; zbMATH DE number 6227051 |
Statements
14 November 2013
0 references
computational topology
0 references
topological graph theory
0 references
parametric shortest paths
0 references
dynamic data structures
0 references
Multiple-source shortest paths in embedded graphs (English)
0 references
0.8905966281890869
0 references
0.8398540616035461
0 references
0.8302953839302063
0 references
0.8300173878669739
0 references
