A distributed algorithm for directed minimum-weight spanning tree (Q2689838): Difference between revisions

From MaRDI portal
Added link to MaRDI 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-021-00398-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3173612603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed exact weighted all-pairs shortest paths in near-linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods in the congested clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Source Shortest Paths in the CONGEST Model with Improved Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic coin tossing with applications to optimal parallel list ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / 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: 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: A faster distributed protocol for constructing a minimum spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved distributed algorithms for exact shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: MST in Log-Star Rounds of Congested Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5090925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Communication Complexity of Set Intersection / 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: Q5567717 / 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: A note on finding optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thek best spanning arborescences of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed approximation algorithms for weighted shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608063 / 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: On the distributional complexity of disjointness / 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: Finding optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sub-linear distributed algorithms for sparse certificates and biconnected components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal approximate shortest paths and transshipment in distributed and streaming models / rank
 
Normal rank

Latest revision as of 12:43, 4 December 2024

scientific article
Language Label Description Also known as
English
A distributed algorithm for directed minimum-weight spanning tree
scientific article

    Statements

    A distributed algorithm for directed minimum-weight spanning tree (English)
    0 references
    0 references
    0 references
    14 March 2023
    0 references
    distributed computing
    0 references
    directed minimum spanning tree
    0 references
    arborescence
    0 references
    CONGEST
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers