A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fast distributed network decompositions and covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Locality of Some NP-Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed (δ+1)-coloring in linear (in δ) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic distributed vertex coloring in polylogarithmic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Graph Coloring: Fundamentals and Recent Developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Locality of Distributed Symmetry Breaking / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation for the Directed Spanner Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / 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: On the locality of distributed sparse spanner construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed spanners via flow-based linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons / rank
 
Normal rank
Property / cites work
 
Property / cites work: A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating \(k\)-spanner problems for \(k>2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of finite sets in which no set is covered by the union of \(r\) others / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero knowledge and the chromatic number / 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: Parallel Symmetry-Breaking in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Sparse 2-Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-Fast 3-Ruling Sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the locality of bounded growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-time distributed dominating set approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Dominating Set Approximation in Graphs of Bounded Arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low diameter graph decompositions / 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: Probability and Computing / 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: What can be computed locally? / rank
 
Normal rank
Property / cites work
 
Property / cites work: New and Improved Bounds for the Minimum Set Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry breaking depending on the chromatic number or the neighborhood growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A log-star distributed maximal independent set algorithm for growth-bounded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Latest revision as of 06:59, 11 July 2024

scientific article
Language Label Description Also known as
English
A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation
scientific article

    Statements

    A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (English)
    0 references
    0 references
    0 references
    0 references
    8 January 2016
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references