Simple and efficient network decomposition and synchronization (Q1575640): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparser: A Paradigm for Running Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of network synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing with Polynomial Communication-Space Trade-Off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online tracking of mobile users / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / 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: Low diameter graph decompositions / rank
 
Normal rank

Revision as of 13:13, 30 May 2024

scientific article
Language Label Description Also known as
English
Simple and efficient network decomposition and synchronization
scientific article

    Statements

    Simple and efficient network decomposition and synchronization (English)
    0 references
    21 August 2000
    0 references
    0 references
    graph decompositions
    0 references
    asynchronous communication networks
    0 references
    synchronizers
    0 references
    0 references
    0 references