Eigenvalue bounds, spectral partitioning, and metrical deformations via flows

Journal of the ACM

Volumn 57, Issue 3, 2010, Pages

  Biswal, Punyashloka ^a   Lee, James R ^a   Rao, Satish ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Metric embeddings; Network flows; Spectral graph theory

Indexed keywords

ARBITRARY GRAPHS; BOUNDED DEGREE GRAPHS; CIRCLE PACKING; EIGEN-VALUE; EIGENVALUE BOUNDS; EIGENVECTORS; EUCLIDEAN SPACES; GENERAL CLASS; GEOMETRIC GRAPHS; LAPLACIANS; MAXIMUM DEGREE; METRIC EMBEDDINGS; MULTI-COMMODITY FLOW; N-VERTEX GRAPH; NETWORK FLOWS; OPTIMAL BOUNDS; PLANAR GRAPH; RAYLEIGH QUOTIENTS; SEPARATOR THEOREMS; SPECTRAL ALGORITHM; SPECTRAL GRAPH THEORY; SPECTRAL PARTITIONING; SUBLINEAR; SWEEP ALGORITHMS;

CONFORMAL MAPPING; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; SEPARATORS; THEOREM PROVING;

GRAPHIC METHODS;

EID: 77950361249     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1706591.1706593     Document Type: Article

References (51)

1. ALON, N., AND MILMAN, V. D. 1985. λ1, isoperimetric inequalities for graphs, and superconcentrators. J. Combin. Theory Ser. B 38, 1, 73-88.
2. ALON, N., SEYMOUR, P., AND THOMAS, R. 1990. A separator theorem for nonplanar graphs. J. Amer. Math. Soc. 3, 4, 801-808.
3. ALPERT, C. J., AND KAHNG, A. B. 1995. Recent directions in netlist partitioning: A survey. Integration: The VLSI J. 19, 1-81.
4. BARTAL, Y. 1996. Probabilistic approximations of metric space and its algorithmic application. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 183-193.
5. BOLLOB́AS, B., CATLIN, P. A., AND ERDOS, P. 1980. Hadwiger's conjecture is true for almost every graph. Europ. J. Combin. 1, 3, 195-199.
6. BOURGAIN, J. 1985. On Lipschitz embedding of finite metric spaces in Hilbert space. Israel J. Math. 52, 1-2, 46-52.
7. BOYD, S., ANDVANDENBERGHE, L. 2004. Convex optimization. Cambridge University Press, Cambridge, U.K.
8. CALINESCU, G., KARLOFF, H., AND RABANI, Y. 2001. Approximation algorithms for the 0-extension problem. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 8-16.
9. CHAN, P. K., SCHLAG, M., AND ZIEN, J. 1993. Speactral k-way ratio cut partitioning and clustering. In Proceedings of the Symposium on Integrated Systems.
10. CHAN, T. F., AND RESASCO,D. C. 1987. Aframework for the analysis and construction of domain decomposition preconditioners. In Proceedings of the 1st International Symposium on Domain Decomposition Methods for Partial Differential Equations. 217-230.
11. CHAN, T. F., AND SMITH, B. 1993. Domain decomposition and multigrid algorithms for elliptic problems on unstructured meshes. Contemp. Math., 1-14.
12. CHEEGER, J. 1970. A lower bound for the smallest eigenvalue of the Laplacian. In Problems in Analysis (Papers dedicated to Salomon Bochner, 1969). Princeton Univ. Press, Princeton, NJ, 195-199.
13. CHUNG, F. R. K. 1997. Spectral Graph Theory. CBMS Regional Conference Series in Mathematics, vol.92. Published for the Conference Board of the Mathematical Sciences, Washington, DC.
14. DIESTEL, R. 2005. Graph Theory, Third ed. Graduate Texts in Mathematics, vol.173. Springer-Verlag, Berlin, Germany.
15. DUFFIN, R. J. 1962. The extremal length of a network. J. Math. Anal. Appl. 5, 200-215.
16. FAKCHAROENPHOL, J., AND TALWAR, K. 2003. An improved decomposition theorem for graphs excluding a fixed minor. In Proceedings of 6th Workshop on Approximation, Randomization, and Combinatorial Optimization. Lecture Notes in Computer Science, vol.2764. Springer-Verlag, Berlin, Germany, 36-46.
17. FEIGE, U., HAJIAGHAYI, M. T., AND LEE, J. R. 2005. Improved approximation algorithms for minimumweight vertex separators. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing. ACM, New York (To appear, SIAM J. Comput.)
18. FERNANDEZ DE LA VEGA, W. 1983. On the maximum density of graphs which have no subcontraction to Ks . Discrete Math. 46, 1, 109-110.
19. GILBERT, J. R., HUTCHINSON, J. P., AND TARJAN, R. E. 1984. A separator theorem for graphs of bounded genus. J. Algorithms 5, 3, 391-407.
20. GRIGOR-YAN, A., AND YAU, S.-T. 1999. Decomposition of a metric space by capacitors. In Differential equations: La Pietra 1996 (Florence). Proceedings of the Symposium on Pure Mathenatics. vol.65. Providence, RI, 39-75.
21. GUATTERY, S., AND MILLER, G. L. 1998. On the quality of spectral separators. SIAM J. Matrix Anal. Appl. 19, 3, 701-719 (electronic).
22. HAGEN, L., AND KAHNG, A. B. 1992. New spectral methods for ratio cut partitioning and clustering. IEEE Trans. Computer-Aided Des. 11, 9, 1074-1085.
23. HARARY, F. 1994. Graph Theory. Addison-Wesley, Reading, MA.
24. HE, Z.-X., AND SCHRAMM, O. 1995. Hyperbolic and parabolic packings. Discrete Comput. Geom. 14, 2, 123-149.
25. HERSCH, J. 1970. Quatre propríet́es isoṕeriḿ etriques de membranes sph́eriques homog̀enes. C. R. Acad. Sci. Paris Śer. A-B 270, A1645-A1648.
26. KELNER, J. A. 2006. Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus. SIAM J. Comput. 35, 4, 882-902 (electronic).
27. KLEIN, P. N., PLOTKIN, S. A., AND RAO, S. 1993. Excluded minors, network decomposition, and multicommodity flow. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing. ACM, New York, 682-690.
28. KOREVAAR, N. 1993. Upper bounds for eigenvalues of conformal metrics. J. Different. Geom. 37, 1, 73-93.
29. KOSTOCHKA, A. V. 1982. The minimum Hadwiger number for graphs with a given mean degree of vertices. Metody Diskret. Analiz. 38, 37-58.
30. KRAUTHGAMER, R., LEE, J. R.,MENDEL, M., AND NAOR, A. 2005. Measured descent: A new embedding method for finite metrics. Geom. Funct. Anal. 15, 4, 839-858.
31. LIPTON, R. J., AND TARJAN, R. E. 1979. Aseparator theorem for planar graphs. SIAM J. Appl. Math. 36, 2, 177-189.
32. LOVÁSZ, L. 2006. Graph minor theory. Bull. Amer. Math. Soc. (N.S.) 43, 1, 75-86 (electronic).
33. LOVÁSZ, L. 2007. Geometric representations of graphs. http://www.cs.elte.hu/∼lovasz/ geomrep.pdf.
34. MIHAIL, G. 1989. Conductance and convergence of Markov chains-a combinatorial treatment of expanders. In Proceedings of the IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 14-23.
35. MILLER, G. L., TENG, S.-H., THURSTON, W., AND VAVASIS, S. A. 1997. Separators for sphere-packings and nearest neighbor graphs. J. ACM 44, 1, 1-29.
36. MILLER, G. L., TENG, S.-H., THURSTON, W., AND VAVASIS, S. A. 1998. Geometric separators for finiteelement meshes. SIAM J. Sci. Comput. 19, 2, 364-386.
37. MILLER, G. L., AND THURSTON, W. 1990. Separators in two and three dimensions. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC'90). ACM, New York, 300-309.
38. PLOTKIN, S., RAO, S., AND SMITH, W. D. 1994. Shallow excluded minors and improved graph decompositions. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 462-470.
39. POTHEN, A., SIMON, H. D., AND WANG, L. 1992. Spectral nested disection. Technical report CS-92-101, Department of Computer Science, Pennsylvania State University.
40. RABINOVICH, Y. 2003. On average distortion of embedding metrics into the line and into L1. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing. ACM, New York.
41. RAO, S. 1999. Small distortion and volume preserving embeddings for planar and Euclidean metrics. In Proceedings of the 15th Annual Symposium on Computational Geometry. ACM, New York, 300-306.
42. SCHOEN, R., AND YAU, S.-T. 1994. Lectures on Differential Geometry. Conference Proceedings and Lecture Notes in Geometry and Topology, I. International Press, Cambridge, MA.
43. SCHRAMM, O. 1993. Square tilings with prescribed combinatorics. Israel J. Math. 84, 1-2, 97-118.
44. SHAHROKHI, F., ŚYKORA, O., SŹEKELY, L. A., AND VRŤO, I. 1996. The crossing number of a graph on a compact 2-manifold. Advances in Mathematics 123, 2, 105-119.
45. SHI, J., AND MALIK, J. 2000. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22, 8, 888-905.
46. SIMOH,H.D. 1991. Partitioning of unstructured problems for parallel processing. Comput. Syst. Eng. 2, 2, 135-148.
47. SPIELMAN, D. A., AND TENG, S.-H. 2007. Spectral partitioning works: Planar graphs and finite element meshes. Linear Algebra and its Applications: Special Issue in honor of MiroslavFiedler 421, 2-3 (March), 284-305.
48. TENG, S.-H. 1998. Combinatorial aspects of geometric graphs. Computational Geometry, 277-287.
49. THOMASON, A. 1984. An extremal function for contractions of graphs. Math. Proc. Cambridge Philos. Soc. 95, 2, 261-265.
50. WILLIAMS, R. D. 1990. Performance of dynamic load balancing algorithms for unstructured mesh calculations. Tech. rep. California Institute of Technology.
51. YANG, P. C., AND YAU, S. T. 1980. Eigenvalues of the Laplacian of compact Riemann surfaces and minimal submanifolds. Ann. Scuola Norm. Sup. Pisa Cl. Sci. (4) 7, 1, 55-63.