An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs (Q1767365)
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: An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs |
scientific article; zbMATH DE number 2143244
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs |
scientific article; zbMATH DE number 2143244 |
Statements
An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs (English)
0 references
10 March 2005
0 references
0 references
0 references
0.93401533
0 references
0.91005266
0 references
0.91005266
0 references
0.90990907
0 references
