An optimal algorithm to solve the all-pair shortest path problem on interval graphs (Q3989542)

From MaRDI portal
Revision as of 13:40, 23 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    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

    Identifiers