Abstract
A fast parallel algorithm that computes a vertex colouring with a constant number of colours is presented. The algorithm works for a wide class of graphs, including graphs of fixed degree or of fixed genus.
It can be realized simultaneously within uniform Boolean depth O( log2n) and polynomial size.
An application of this colouring algorithm yields an O( log2n ) depth computation of maximal independent sets, which considerably improves the known O( log4n ) depth algorithm for a great class of graphs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aho, A., Hopcroft, J., Ullman, J.; The Design and Analysis of Computer Algorithms; Addison-Wesley; Mass. 1974
Cook,S.A.; The Classification of Problems which have Fast Parallel Algorithms; FCT83; LNCS 158
Garey, M.R., Johnson, D.S.; Computers and Intractability; A Guide to the Theory of NP-Completeness; Freeman; San Francisco 1979
Harary, F.; Graph Theory; Addison-Wesley; Mass. 1971
Karp,R.M., Wigderson,A.; Fast Parallel Algorithm for the Maximal Independent Set Problem; 16th STOC 1984
Ruzzo, W.L.; On Uniform Circuit Complexity; JCSS 22(1981); 365–383
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bauernöppel, F., Jung, H. (1985). Fast parallel vertex colouring. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028788
Download citation
DOI: https://doi.org/10.1007/BFb0028788
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15689-5
Online ISBN: 978-3-540-39636-9
eBook Packages: Springer Book Archive