An optimal algorithm to solve the all-pair shortest path problem on interval graphs (Q3989542): 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 00:37, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal algorithm to solve the all-pair shortest path problem on interval graphs |
scientific article |
Statements
An optimal algorithm to solve the all-pair shortest path problem on interval graphs (English)
0 references
28 June 1992
0 references
unweighted all-pair shortest path
0 references
interval graphs
0 references
perfect graphs
0 references
neighborhood tree
0 references
