All-pairs shortest paths for unweighted undirected graphs in <i>o(mn)</i> time (Q3581545)

From MaRDI portal
Revision as of 07:01, 13 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
All-pairs shortest paths for unweighted undirected graphs in <i>o(mn)</i> time
scientific article

    Statements

    All-pairs shortest paths for unweighted undirected graphs in <i>o(mn)</i> time (English)
    0 references
    0 references
    16 August 2010
    0 references

    Identifiers