Low‐diameter graph decomposition is in NC
- 1 July 1994
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 5 (3), 441-452
- https://doi.org/10.1002/rsa.3240050305
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Fast network decompositionPublished by Association for Computing Machinery (ACM) ,1992
- Faster algorithms for finding small edge cuts in planar graphsPublished by Association for Computing Machinery (ACM) ,1992
- Sparser: A paradigm for running distributed algorithmsLecture Notes in Computer Science, 1992
- Network decomposition and locality in distributed computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Removing randomness in parallel computation without a processor penaltyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,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
- A fast parallel algorithm for the maximal independent set problemJournal of the ACM, 1985
- Complexity of network synchronizationJournal of the ACM, 1985