Distributed algorithms for computing shortest pairs of disjoint paths (Q4202064)

From MaRDI portal
Revision as of 18:30, 26 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 404191
Language Label Description Also known as
English
Distributed algorithms for computing shortest pairs of disjoint paths
scientific article; zbMATH DE number 404191

    Statements

    Distributed algorithms for computing shortest pairs of disjoint paths (English)
    0 references
    0 references
    0 references
    0 references
    13 January 1994
    0 references
    disjoint paths
    0 references
    shortest path
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references