R-Kleene: a high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks (Q870454)
From MaRDI portal
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
