All-pairs shortest paths for unweighted undirected graphs in <i>o(mn)</i> time (Q3581545): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:50, 5 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | All-pairs shortest paths for unweighted undirected graphs in <i>o(mn)</i> time |
scientific article |
Statements
All-pairs shortest paths for unweighted undirected graphs in <i>o(mn)</i> time (English)
0 references
16 August 2010
0 references