An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs (Q1767365): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02936037 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2159279760 / rank | |||
Normal rank | |||
Latest revision as of 11:18, 30 July 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
0 references
0 references
