A survey of the all-pairs shortest paths problem and its variants in graphs (Q2629565)
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 6601332
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A survey of the all-pairs shortest paths problem and its variants in graphs |
scientific article; zbMATH DE number 6601332 |
Statements
A survey of the all-pairs shortest paths problem and its variants in graphs (English)
0 references
6 July 2016
0 references
algorithms
0 references
all-pairs shortest paths
0 references
average distance
0 references
graph algorithms
0 references
MAD tree
0 references
spanning tree
0 references
Wiener index
0 references
0 references
0 references
0 references
0 references
0.7699617743492126
0 references
0.7696595788002014
0 references
0.7395234704017639
0 references
