Finding connected components of an intersection graph of squares in the Euclidean plane
- 11 October 1982
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 15 (3) , 125-128
- https://doi.org/10.1016/0020-0190(82)90044-8
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- On the complexity of computations under varying sets of primitivesJournal of Computer and System Sciences, 1979
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975