Low diameter graph decompositions (Q1316650): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Michael E. Saks / rank
Normal rank
 
Property / author
 
Property / author: Michael E. Saks / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Complexity of network synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3896960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of Tucker's combinatorial lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Game of Hex and the Brouwer Fixed-Point Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Symmetry-Breaking in Sparse 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: Q5522742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of fixed points and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial proof of the Borsuk-Ulam antipodal point theorem / rank
 
Normal rank

Latest revision as of 13:33, 22 May 2024

scientific article
Language Label Description Also known as
English
Low diameter graph decompositions
scientific article

    Statements

    Low diameter graph decompositions (English)
    0 references
    0 references
    0 references
    0 references
    22 June 1994
    0 references
    A preliminary version of this paper appeared as ``Decomposing graphs into regions of small diameter'' in Proc. 2nd ACM-SIAM Symposium on Discrete Algorithms, 320-330 (1991; Zbl 0785.05073).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    decomposition
    0 references
    blocks
    0 references
    diameter
    0 references
    distributed computations
    0 references
    distributed algorithm
    0 references
    Sperner's lemma
    0 references
    Tucker's lemma
    0 references