All-pairs shortest paths for unweighted undirected graphs in <i>o(mn)</i> time (Q3581545): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1109557.1109614 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4246466944 / rank | |||
Normal rank | |||
Latest revision as of 15:31, 19 March 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
