O(1) QUERY TIME ALGORITHM FOR ALL PAIRS SHORTEST DISTANCES ON INTERVAL GRAPHS (Q5249020)

From MaRDI portal
Revision as of 00:16, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6432023
Language Label Description Also known as
English
O(1) QUERY TIME ALGORITHM FOR ALL PAIRS SHORTEST DISTANCES ON INTERVAL GRAPHS
scientific article; zbMATH DE number 6432023

    Statements

    O(1) QUERY TIME ALGORITHM FOR ALL PAIRS SHORTEST DISTANCES ON INTERVAL GRAPHS (English)
    0 references
    0 references
    0 references
    29 April 2015
    0 references
    interval graphs
    0 references
    unit interval graphs
    0 references
    circular arc graphs
    0 references
    APSP
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references