R-Kleene: a high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks (Q870454): 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.1007/s00453-006-1224-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2020545624 / rank | |||
Normal rank | |||
Revision as of 23:55, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | R-Kleene: a high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks |
scientific article |
Statements
R-Kleene: a high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks (English)
0 references
12 March 2007
0 references
