Efficient distributed algorithms for single-source shortest paths and related problems on plane networks (Q4000864): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity of network synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new distributed depth-first-search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new distributed algorithm to find breadth first search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Covering Vertices by Faces in a Planar Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing networks with compact routing tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-efficient and fault-tolerant message routing in outerplanar networks / rank
 
Normal rank

Latest revision as of 09:33, 16 May 2024

scientific article
Language Label Description Also known as
English
Efficient distributed algorithms for single-source shortest paths and related problems on plane networks
scientific article

    Statements

    Efficient distributed algorithms for single-source shortest paths and related problems on plane networks (English)
    0 references
    0 references
    0 references
    26 September 1992
    0 references
    distributed algorithm
    0 references
    shortest-path tree
    0 references
    outerplanar decomposition
    0 references
    distributed single-source shortest-path algorithm
    0 references
    routing
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references