R-Kleene: a high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks (Q870454)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: R-Kleene: a high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks |
scientific article; zbMATH DE number 5133108
| 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; zbMATH DE number 5133108 |
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
