An optimal algorithm to solve the all-pair shortest path problem on interval graphs (Q3989542)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 34716
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal algorithm to solve the all-pair shortest path problem on interval graphs |
scientific article; zbMATH DE number 34716 |
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
0.8620490431785583
0 references
0.846648633480072
0 references
