Low diameter graph decompositions
- 1 December 1993
- journal article
- research article
- Published by Springer Nature in Combinatorica
- Vol. 13 (4) , 441-454
- https://doi.org/10.1007/bf01303516
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Locality in Distributed Graph AlgorithmsSIAM Journal on Computing, 1992
- Sparser: A paradigm for running distributed algorithmsPublished by Springer Nature ,1992
- Parallel Symmetry-Breaking in Sparse GraphsSIAM Journal on Discrete Mathematics, 1988
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986
- Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithmsPublished by Association for Computing Machinery (ACM) ,1986
- Complexity of network synchronizationJournal of the ACM, 1985
- A constructive proof of Tucker's combinatorial lemmaJournal of Combinatorial Theory, Series A, 1981
- The Game of Hex and the Brouwer Fixed-Point TheoremThe American Mathematical Monthly, 1979
- The Computation of Fixed Points and ApplicationsPublished by Springer Nature ,1976