An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs (Q1398021): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1023695531209 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1487407889 / rank | |||
Normal rank | |||
Latest revision as of 10:49, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs |
scientific article |
Statements
An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs (English)
0 references
6 August 2003
0 references
design of algorithms
0 references
analysis of algorithms
0 references
shortest paths
0 references
average distance
0 references
permutation graphs
0 references
