Parallel Symmetry-Breaking in Sparse Graphs
- 1 November 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 1 (4) , 434-446
- https://doi.org/10.1137/0401044
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- A New Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1989
- Coloring planar graphs in parallelJournal of Algorithms, 1987
- Parallel (Δ + 1)-coloring of constant-degree graphsInformation Processing Letters, 1987
- Parallel 5-colouring of planar graphsPublished by Springer Nature ,1987
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986
- An improved parallel algorithm for maximal matchingInformation Processing Letters, 1986
- Complexity of network synchronizationJournal of the ACM, 1985
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- A linear 5-coloring algorithm of planar graphsJournal of Algorithms, 1981
- Parallelism in random access machinesPublished by Association for Computing Machinery (ACM) ,1978