An optimal algorithm to solve the all-pair shortest path problem on interval graphs (Q3989542): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q223031 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Madhav V. Marathe / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230220103 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2082795813 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3328583 / rank | |||
Normal rank | |||
Latest revision as of 16:08, 15 May 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
