Graph clustering and minimum cut trees

Internet Mathematics

Volumn 1, Issue 4, 2004, Pages 385-408

  Flake, Gary William ^a   Tarjan, Robert E ^b   Tsioutsiouliklis, Kostas ^c  

^a YAHOO RESEARCH   (United States)

^b Princeton University   (United States)

^c NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84906283185     PISSN: 15427951     EISSN: 19449488     Source Type: Journal    
DOI: 10.1080/15427951.2004.10129093     Document Type: Article

References (26)

1. [Bern and Eppstein 96] M. Bern and D. Eppstein. "Approximation Algorithms for Geometric Problems". In Approximation Algorithms for NP-Hard Problems, edited by D. S. Hochbaum, pp. 296-345. Boston: PWS Publishing Company, 1996.
2. [Brin and Page 98] S. Brin and L. Page. "Anatomy of a Large-Scale Hypertextual Web Search Engine". In Proc. 7th International World Wide Web Conference, pp. 107-117. New York: ACM Press, 1998.
3. [Chekuri et al. 97] C. S. Chekuri, A. V. Goldberg, D. R. Karger, M. S. Levine, and C. Stein. "Experimental Study of Minimum Cut Algorithms". In Proc. 8th ACM-SIAM Symposium on Discrete Algorithms, pp. 324-333. Philadelphia: SIAM Press, 1997.
4. [Cherkassky and Goldberg 97] B. V. Cherkassky and A. V. Goldberg. "On Implementing Push-Relabel Method for the Maximum Flow Problem". Algorithmica 19 (1997), 390-410.
5. [CiteSeer 97] CiteSeer. Available from World Wide Web (http://www.citeseer.com), 1997.
6. [Dmoz 98] Dmoz. Available from World Wide Web (http://www.dmoz.org), 1998.
7. [Everitt 80] B. Everitt. Cluster Analysis. New York: Halsted Press, 1980.
8. [Flake et al. 00] G. W. Flake, S. Lawrence, and C. L. Giles. "Efficient Identification of Web Communities". In Proceedings of the Sixth International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD-2000), pp. 150-160. New York: ACM Press, 2000.
9. [Ford and Fulkerson 62] L. R. Ford Jr. and D. R. Fulkerson. Flows in Networks. Princeton: Princeton University Press, 1962.
10. [Gallo et al. 89] G. Gallo, M. D. Grigoriadis, and R. E. Tarjan. "A Fast Parametric Maximum Flow Algorithm and Applications". SIAM Journal of Computing 18:1 (1989), 30-55.
11. [Garey and Johnson 79] M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
12. [Goldberg 98] A. V. Goldberg. "Recent Developments in Maximum Flow Algorithms". Technical Report No. 98-045, NEC Research Institute, Inc., 1998.
13. [Goldberg and Tarjan 88] A. V. Goldberg and R. E. Tarjan. "A New Approach to the Maximum Flow Problem". J. Assoc. Comput. Mach. 35 (1998), 921-940.
14. [Goldberg and Tsioutsiouliklis] A. V. Goldberg and K. Tsioutsiouliklis. "Cut Tree Algorthms: An Experimental Study". J. Algorithms. 38:1 (2001), 51-83.
15. [Gomory and Hu 61] R. E. Gomory and T. C. Hu. "Multi-Terminal Network Flows". J. SIAM 9 (1961), 551-570.
16. [Hu 82] T. C. Hu. Combinatorial Algorithms. Reading, MA: Addison-Wesley, 1982.
17. [Jain and Dubes 88] A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Englewood Cliffs, NJ: Prentice-Hall, 1988.
18. [Kannan et al. 00] R. Kannan, S. Vempala, and A. Vetta. "On Clusterings-Good, Bad and Spectral". In IEEE Symposium on Foundations of Computer Science, pp. 367-377. Los Alamitos, CA: IEEE Computer Society, 2000.
19. [Karp 72] R. M. Karp. "Reducibility among Combinatorial Problems". In Complexity of Computer Computations, edited by R. E. Miller and J. W. Thatcher, pp. 85-103. New York: Plenum Press, 1972.
20. [Kleinberg 98] Jon Kleinberg. "Authoritative Sources in a Hyperlinked Environment". In Proc. 9th ACM-SIAM Symposium on Discrete Algorithms, pp. 668-677. New York: ACM Press, 1998.
21. [Mancoridis et al. 98] S. Mancoridis, B. Mitchell, C. Rorres, Y. Chen, and E. Gansner. "Using Automatic Clustering to Produce High-Level System Organizations of Source Code". In Proceedings of the 6th Intl. Workshop on Program Comprehension, pp. 45-53. Los Alamitos, CA: IEEE Computer Society, 1998.
22. [Nagamochi et al 94] H. Nagamochi, T. Ono, and T. Ibaraki. "Implementing an Efficient Minimum Capacity Cut Algorithm". Math. Prog. 67 (1994), 297-324.
23. [Nguyen and Venkateswaran 93] Q. C. Nguyen and V. Venkateswaran. "Implementations of Goldberg-Tarjan Maximum Flow Algorithm". In Network Flows and Matching: First DIMACS Implementation Challenge, edited by D. S. Johnson and C. C. McGeoch, pp. 19-42. Providence, RI: Amer. Math. Soc., 1993.
24. [Padberg and Rinaldi 90] M. Padberg and G. Rinaldi. "An Efficient Algorithm for the Minimum Capacity Cut Problem". Math. Prog. 47 (1990), 19-36.
25. [Saran and Vazirani 91] H. Saran and V. V. Vazirani. "Finding k-Cuts within Twice the Optimal". In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, pp. 743-751. Los Alamitos, CA: IEEE Computer Society, 1991.
26. [Wu and Leahy 93] Z. Wu and R. Leahy "An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation". IEEE Transactions on Pattern Analysis and Machine Intelligence 15:11 (1993), 1101-1113.