Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- 1 December 1983
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 4 (4) , 310-323
- https://doi.org/10.1016/0196-6774(83)90012-3
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Education, Culture, Sports, Science and Technology
This publication has 5 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Finding connected components of an intersection graph of squares in the Euclidean planeInformation Processing Letters, 1982
- Connected Component Labeling Using QuadtreesJournal of the ACM, 1981
- Optimal packing and covering in the plane are NP-completeInformation Processing Letters, 1981
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975