Distributed MST for constant diameter graphs (Q5919895): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00446-005-0127-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032607682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharing memory robustly in message-passing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem / 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: Parallelism in random access machines / 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: Fast Distributed Construction of Smallk-Dominating Sets and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / 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: How to share memory in a distributed system / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:25, 6 July 2024

scientific article; zbMATH DE number 6175625
Language Label Description Also known as
English
Distributed MST for constant diameter graphs
scientific article; zbMATH DE number 6175625

    Statements

    Distributed MST for constant diameter graphs (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    distributed algorithm
    0 references
    minimum-weight spanning tree
    0 references
    0 references