External-memory exact and approximate all-pairs shortest-paths in undirected graphs (Q2921735)
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 6354891
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | External-memory exact and approximate all-pairs shortest-paths in undirected graphs |
scientific article; zbMATH DE number 6354891 |
Statements
13 October 2014
0 references
External-memory exact and approximate all-pairs shortest-paths in undirected graphs (English)
0 references
0.91899174451828
0 references
0.8241593241691589
0 references
0.8213551044464111
0 references
0.8075528740882874
0 references
