Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q1981632): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
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 trade-off between information and communication in broadcast protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed exact shortest paths in sublinear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient threshold detection in a distributed environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal distributed algorithm for minimum spanning trees revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5090922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5090924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic graph connectivity in polylogarithmic worst case time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Universal Leader Election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast distributed construction of <i>k</i>-dominating sets and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Synchronizer for the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Verification and Hardness of Distributed Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A highly asynchronous minimum spanning tree protocol / rank
 
Normal rank

Latest revision as of 13:04, 26 July 2024

scientific article
Language Label Description Also known as
English
Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model
scientific article

    Statements

    Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (English)
    0 references
    0 references
    0 references
    6 September 2021
    0 references
    distributed computing
    0 references
    minimum spanning tree
    0 references
    broadcast tree
    0 references
    0 references
    0 references
    0 references

    Identifiers