Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane
暂无分享,去创建一个
[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[2] Michael Ian Shamos,et al. Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[3] Hanan Samet,et al. Connected Component Labeling Using Quadtrees , 1981, JACM.
[4] Robert J. Fowler,et al. Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..
[5] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.
[6] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[7] Hiroshi Imai. Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane , 1982, Inf. Process. Lett..
[8] Amnon Naamad,et al. Network flow and generalized path compression , 1979, STOC.
[9] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..