All-pairs shortest paths for unweighted undirected graphs in \(o(mn)\) time (Q3189076)
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 6341946
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All-pairs shortest paths for unweighted undirected graphs in \(o(mn)\) time |
scientific article; zbMATH DE number 6341946 |
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
0.9250814914703368
0 references
0.8731346130371094
0 references
0.8731346130371094
0 references
0.8629516363143921
0 references
