An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs (Q1767365): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:37, 5 March 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
