Clustering in trees: Optimizing cluster sizes and number of subtrees

Journal of Graph Algorithms and Applications

Volumn 4, Issue 4, 2000, Pages 1-26

  Hambrusch, Susanne E ^a   Liu, Chuan Ming ^a   Lim, Hyeong Seok ^b  

^a Purdue University   (United States)

^b Chonnam National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037648043     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00031     Document Type: Article

References (14)

1. J. Banerjee, W. Kim, S.-J. Kim, and J. F. Garza. Clustering a DAG for CAD databases. IEEE Transactions on Software Engineering (SE), 14(11), Nov. 1988.
2. R. Bayer and E. McCreight. Organization and maintenance of large ordered indices. Acta Informatica, 1:173-189, 1972.
3. T. Cormen, C. Leiserson, and R. Rivest. Introduction to algorithms. The MIT Press, 1990.
4. A. A. Diwan, S. Rane, S. Seshadri, and S. Sudarshan. Clustering techniques for minimizing external path length. In Proceedings of the 22-nd International Conference on Very Large Data Bases, pages 342-353, 1996.
5. A. Farley, S. Hedetniemi, and A. Proskurowski. Partitioning trees: matching, domination, and maximum diameter. International Journal of Computer and Information Sciences, 10(1):55-61, Feb. 1981.
6. A. Gerasoulis and T. Yang. On the granularity and clustering of directed acyclic task graphs. IEEE Transactions on Parallel and Distributed Systems, 4(6):686-701, June 1993.
7. J. Gil and A. Itai. How to pack trees. Journal of Algorithms, 32, 1999.
8. S. Hambrusch and C.-M. Liu. Data replication for external searching in static tree structures. In Proceedings of the Ninth ACM International Conference on Information and Knowledge Management, Nov. 2000.
9. C.-M. Liu. Searching in static, external memory data structures. Ph.d. thesis, Purdue University, Department of Computer Sciences, in progress.
10. P. Maheshwari and H. Shen. An efficient clustering algorithm for partitioning parallel program. Parallel Computing, 24(5-6):893-909, June 1998.
11. D. M. Nicol and D. R. O'Hallaron. Improved algorithms for mapping pipelined and parallel computations. IEEE Transactions on Computers, 40(3):295-306, Mar. 1991.
12. M. H. Nodine, M. T. Goodrich, and J. S. Vitter. Blocking for external graph searching. Algorithmica, 16(2):181-214, Aug. 1996.
13. S. Ramaswamy and S. Subramanian. Path caching: A technique for optimal external searching. In Proceedings of the Thirteenth ACM Symposium on Principles of Database Systems, volume 13, pages 25-35, 1994.
14. R. Schrader. Approximations to clustering and subgraph problems on trees. Discrete Applied Mathematics, 6:301-309, 1983.