Unbalanced graph cuts

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 191-202

  Hayrapetyan, Ara ^a   Kempe, David ^b   Pál, Martin ^c   Svitkina, Zoya ^a  

^a Department of Obstetrics Gynecology   (United States)

^b University of Southern California ^*  (United States)

^c Center for Discrete Mathematics and Theoretical Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; NUMBER THEORY; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS; BUDGET CONSTRAINTS; GRAPH CUTS; OPTIMAL SOLUTION;

GRAPH THEORY;

EID: 27144513769     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_19     Document Type: Conference Paper

References (25)

1. R. Ahuja, T. Magnanti, and J. Orlin. Network Flows. Prentice Hall, 1993.
2. S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings and graph partitioning. In STOC, 2004.
3. Y. Asahiro, K. Iwama, H. Tamaki, and T. Tokuyama. Greedily finding a dense subgraph. Journal of Algorithms, 34, 2000.
4. N. Bailey. The Mathematical Theory of Infectious Diseases and its Applications. Hafner Press, 1975.
5. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. on Computing, 25:1305-1317, 1996.
6. M. Develin and S. G. Hartke. Fire containment in grids of dimension three and higher, 2004. Submitted.
7. S. Eubank, H. Guclu, V.S.A. Kumar, M.V. Marathe, A. Srinivasan, Z. Toroczkai, and N. Wang. Modelling disease outbreaks in realistic urban social networks. Nature, 429:180-184, 2004.
8. S. Eubank, V. S. A. Kumar, M. V. Marathe, A. Srinivasan, and N. Wang. Structure of social contact networks and their impact on epidemics. AMS-DIMACS Special Volume on Epidemiology.
9. S. Eubank, V.S.A. Kumar, M.V. Marathe, A. Srinivasan, and N. Wang. Structural and algorithmic aspects of massive social networks. In SODA, 2004.
10. U. Feige, G. Kortsarz, and D. Peleg. The dense k-subgraph problem. In STOC, 1993.
11. U. Feige and R. Krauthgamer. A polylogarithmic approximation of the minimum bisection. SIAM J. on Computing, 31:1090-1118, 2002.
12. U. Feige, R. Krauthgamer, and K. Nissim. On cutting a few vertices from a graph. Discrete Applied Mathematics, 127:643-649, 2003.
13. U. Feige and M. Seltser. On the densest k-subgraph problem. Technical report, The Weizmann Institute, Rehovot, 1997.
14. G. Flake, S. Lawrence, C. L. Giles, and F. Coetzee. Self-organization of the web and identification of communities. IEEE Computer, 35, 2002.
15. G. Flake, R. Tarjan, and K. Tsioutsiouliklis. Graph clustering techniques based on minimum cut trees. Technical Report 2002-06, NEC, Princeton, 2002.
16. L. Ford and D. Fulkerson. Maximal flow through a network. Can. J. Math, 1956.
17. G. Gallo, M. D. Grigoriadis, and R. E. Tarjan. A fast parametric maximum flow algorithm and applications. SIAM J. on Computing, 18:30-55, 1989.
18. N. Garg, V. V. Vazirani, and M. Yannakakis. Approximate max-flow min(multi)cut theorems and their applications. SIAM J. on Computing, 1996.
19. J. Kleinberg and E. Tardos. Algorithm Design. Addison-Wesley, 2005.
20. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the web for emerging cyber-communities. In WWW, 1999.
21. E. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehard and Winston, 1976.
22. F.T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46, 1999.
23. F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi. Defining and identifying communities in networks. Proc. Natl. Acad. Sci. USA, 2004.
24. D. Shmoys. Cut problems and their application to divide-and-conquer. In D. Hochbaum, editor, Approximation Algorithms for NP-hard problems, pages 192-235. PWD Publishing, 1995.
25. Z. Svitkina and E. Tardos. Min-max multiway cut. In APPROX, 2004.