Distributed Symmetry Breaking on Power Graphs via Sparsification (Q6202239): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Correlation clustering in data streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6084349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear Algorithms for (Δ + 1) Vertex Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Lower Bounds for Ruling Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Deterministic Distributed Coloring with Small Bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Approximation on Power Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Locality of Distributed Symmetry Breaking / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Speedup Theorem for Distributed Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms for the Lovász local lemma and graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Distributed Dominating Set Approximation in the CONGEST Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5874270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Testing of Distance-k Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Distributed Algorithm for Maximal Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed MIS via All-to-All Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Maximal Independent Set using Small Messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved distributed \(\Delta\)-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of local distributed graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-2 Coloring in the CONGEST Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superfast coloring in CONGEST via efficient color sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward Optimal Bounds in the Congested Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward more localized local algorithms: removing assumptions concerning global knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-Fast 3-Ruling Sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and approximation algorithms for channel assignment in radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic distributed ruling sets of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic algorithm for the MST problem in constant rounds of congested clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic-time deterministic network decomposition and distributed derandomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chernoff–Hoeffding Bounds for Applications with Limited Independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry breaking depending on the chromatic number or the neighborhood growth / rank
 
Normal rank

Revision as of 17:06, 28 August 2024

scientific article; zbMATH DE number 7824321
Language Label Description Also known as
English
Distributed Symmetry Breaking on Power Graphs via Sparsification
scientific article; zbMATH DE number 7824321

    Statements

    Distributed Symmetry Breaking on Power Graphs via Sparsification (English)
    0 references
    0 references
    0 references
    0 references
    26 March 2024
    0 references
    distributed algorithm
    0 references
    CONGEST model
    0 references
    maximal independent set
    0 references
    ruling sets
    0 references
    power graphs
    0 references
    sparsification
    0 references
    shattering
    0 references
    0 references
    0 references
    0 references

    Identifiers