All-pairs shortest paths for unweighted undirected graphs in <i>o</i> ( <i>mn</i> ) time (Q3189076)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | All-pairs shortest paths for unweighted undirected graphs in <i>o</i> ( <i>mn</i> ) time |
scientific article |
Statements
All-pairs shortest paths for unweighted undirected graphs in <i>o</i> ( <i>mn</i> ) time (English)
0 references
9 September 2014
0 references
graph algorithms
0 references
shortest paths
0 references
word RAM
0 references
