The local nature of ?-coloring and its algorithmic applications
Authors:
- 1 June 1995
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 15 (2) , 255-280
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Probabilistic recurrence relations1991
- Brooks Coloring in ParallelSIAM Journal on Discrete Mathematics, 1990
- An NC algorithm for Brooks' TheoremTheoretical Computer Science, 1989
- Network decomposition and locality in distributed computation1989
- Parallel Symmetry-Breaking in Sparse GraphsSIAM Journal on Discrete Mathematics, 1988
- A fast parallel algorithm to color a graph with Δ colorsJournal of Algorithms, 1988
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986
- A fast parallel algorithm for routing in permutation networksIEEE Transactions on Computers, 1981
- Graph Theory1979
- On colouring the nodes of a networkMathematical Proceedings of the Cambridge Philosophical Society, 1941