Abstract
The Lexicographically First Maximal Independent Set Problem on graphs with bounded degree 3 is at most \(\sqrt{n}\)-complete, and thus very likely not parallelizable in a fine-grained setting. On the other hand, we show that in a coarse-grained setting (few processors and a lot of data) the situation is different, by giving a work-optimal algorithm on a shared memory machine for n and p such that p ·log p ∈ O(log n).
Research partially supported by the “Pôle régional lorrain Intelligence Logicielle” and a visiting grant by Région Lorraine for Jan Arne Telle.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brent, R.P.: The parallel evaluation of generic arithmetic expressions. Journal of the ACM 21(2), 201–206 (1974)
Condon, A.: A theory of strict P-completeness. Computational Complexity 4, 220–241 (1994)
Culler, D., Karp, R., Patterson, D., Sahay, A., Schauser, K., Santos, E., Subramonian, R., Von Eicken, T.: LogP: Towards a Realistic Model of Parallel Computation. In: Proceeding of 4th ACMSIGPLAN Symp. on Principles and Practises of Parallel Programming, pp. 1–12 (1993)
Dehne, F., Fabri, A., And Rau-Chaplin, A.: Scalable parallel computational geometry for coarse grained multicomputers. International Journal on Computational Geometry 6(3), 379–400 (1996)
Ferreira, A., And Schabanel, N.: A randomized BSP/CGMalgorithm for the maximal independent set. Parallel Processing Letters 9(3), 411–422 (2000)
Gebremedhin, A.H., Guérin Lassous, I., Gustedt, J., Telle, J.: Graph coloring on a coarse grained multiprocessor. In: Brandes, U., Wagner, D. (eds.) WG 2000. LNCS, vol. 1928, pp. 184–195. Springer, Heidelberg (2000)
Gebremedhin, A.H., Guérin Lassous, I., Gustedt, J., Telle, J.: PRO: a model for parallel resource-optimal computation. In: 16th Annual International Symposiumon High Performance Computing Systems and Applications, The Institute of Electrical and Electronics Engineers, pp. 106–113. IEEE, Los Alamitos (2002)
Greenlaw, R., Hoover, J., Ruzzo, W.: Limits to parallel computation: Pcompleteness theory. Oxford University Press, Oxford (1995)
Karp, R.M., Ramachandran, V.: Parallel Algorithms for Shared-Memory Machines. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Algorithms and Complexity, vol. A, pp. 869–941. Elsevier Science Publishers B.V., Amsterdam (1990)
Kruskal, C.P., Rudolph, L., Snir, M.: A complexity theory of efficient parallel algorithms. Theoretical Computer Science 71(1), 95–132 (1990)
Miyano, S.: The lexicographically first maximal subgraph problems: P-completeness and NC-algorithms. Mathematical Systems Theory 22(1), 47–73 (1989)
Uehara, R.: A measure for the lexicographically first maximal independent set problem and its limits. International Journal of Foundations of Computer Science 10(4), 473–482 (1999)
Valiant, L.G.: A bridging model for parallel computation. Communications of the ACM 33(8), 103–111 (1990)
Vitter, J.S., Simons, R.A.: New classes for parallel comlexity. IEEE Trans. Comput. 35, 403–418 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gustedt, J., Telle, J.A. (2003). A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set. In: Blundo, C., Laneve, C. (eds) Theoretical Computer Science. ICTCS 2003. Lecture Notes in Computer Science, vol 2841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45208-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-45208-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20216-5
Online ISBN: 978-3-540-45208-9
eBook Packages: Springer Book Archive