An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs (Q1767365): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:22, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs |
scientific article |
Statements
An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs (English)
0 references
10 March 2005
0 references
