Abstract
In this paper, we study the problem of designing in-place algorithms for finding the maximum clique in the intersection graphs of axis-parallel rectangles and disks in 2D. We first propose O(n 2logn) time in-place algorithms for finding the maximum clique of the intersection graphs of a set of axis-parallel rectangles of arbitrary sizes. For the rectangle intersection graph of fixed height rectangles, the time complexity can be slightly improved to O(nlogn + nK), where K is the size of the maximum clique. For disk graphs, we consider two variations of the maximum clique problem, namely geometric clique and graphical clique. The time complexity of our algorithm for finding the largest geometric clique is O(n 2logn), and it works for disks of arbitrary radii. For graphical clique, our proposed algorithm works for unit disks (i.e., of same radii) and the worst case time complexity is O(n 2 + mK 4); m is the number of edges in the unit disk intersection graph, and K is the size of the largest clique in that graph. It uses O(n 4) time in-place computation of maximum matching in a bipartite graph, which is of independent interest. All these algorithms need O(1) work space in addition to the input array \(\cal R\).
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
Breu, H.: Algorithmic Aspects of Constrained Unit Disk Graphs, Ph.D. Thesis, University of British Columbia, Canada, Tech. Report No. TR-96-15 (1996)
Bronnimann, H., Chan, T.M., Chen, E.Y.: Towards in-place geometric algorithms and data structures. In: Symp. on Computational Geometry, pp. 239–246 (2004)
Chazelle, B.M., Lee, D.T.: On a circle placement problem. Computing 36, 1–16 (1986)
Chan, T.M., Chen, E.Y.: Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection. Comput. Geom. 43, 636–646 (2010)
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graph. Discrete Mathematics 86, 165–177 (1990)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press (1980)
Imai, H., Asano, T.: Finding the connected components and maximum clique of an intersection graph of rectangles in the plane. Journal of Algorithms 4, 310–323 (1983)
Lee, D.T., Preparata, F.P.: An improved algorithm for the rectangle enclosure problem. Journal of Algorithms 3, 218–224 (1982)
Lee, D.T.: Maximum clique problem of rectangle graphs. In: Preparata, F.P. (ed.) Advances in Computing Research, pp. 91–107. JAI Press (1983)
Nandy, S.C., Bhattacharya, B.B.: A unified algorithm for finding maximum and minimum point enclosing rectangles and cuboids. Computers and Mathematics with Applications 29(8), 45–61 (1995)
Preparata, F.P., Shamos, M.I.: Computational Geometry - an Introduction. Springer (1990)
Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice Hall of India Pvt. Ltd., New Delhi (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De, M., Nandy, S.C., Roy, S. (2012). In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29700-7_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-29700-7_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29699-4
Online ISBN: 978-3-642-29700-7
eBook Packages: Computer ScienceComputer Science (R0)