New spectral lower bounds on the bisection width of graphs

Theoretical Computer Science

Volumn 320, Issue 2-3, 2004, Pages 155-174

  Bezrukov, S ^a   Elsasser R ^b   Monien, B ^b   Preis, R ^b,c   Tillich, J P ^d  

^a UNIVERSITY OF WISCONSIN SUPERIOR   (United States)

^b UNIVERSITY OF PADERBORN   (Germany)

^c SANDIA NATIONAL LABORATORIES   (United States)

^d UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

Eigenvalues of graphs; Graph bisection; Laplacian of graphs

Indexed keywords

COMPUTATIONAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; FUNCTIONS; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; THEOREM PROVING;

EIGENVALUES OF GRAPHS; GRAPH BISECTION; LAPLACIAN OF GRAPHS; RAMANUJAN GRAPHS;

COMPUTER SCIENCE;

EID: 2442705765     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.03.059     Document Type: Article

References (22)

1. Alon N. Eigenvalues and expanders. Combinatorica. 6(2):1986;83-96.
2. S.L. Bezroukov, R. Elsässer, B. Monien, R. Preis, J.-P. Tillich, New spectral lower bounds on the bisection width of graphs, in: Workshop on Graph-Theoretic Concepts in Computer Science (WG), Lecture Notes in Computer Science, Vol. 1928, 2000, pp. 23-34.
3. Bollobas B. The isoperimetric number of random regular graphs. European J. Combin. 9:1988;241-244.
4. Bui T.N., Chaudhuri S., Leighton F.T., Sisper M. Graph bisection algorithms with good average case behaviour. Combinatorica. 7(2):1987;171-191.
5. Cheeger J. A lower bound for the smallest eigenvalue of the laplacian. Problems Anal. 1970;195-199.
6. Chiu P. Cubic ramanujan graphs. Combinatorica. 12(3):1992;275-285.
7. Dodziuk J., Kendall W.S. Combinatorial laplacians and isoperimetric inequality. Pitman Res. Notes Math. Ser. 1986;68-74.
8. Elsässer R., Lücking T., Monien B. On spectral bounds for the. k -partioning of graphs Theory Comput. Systems. 36:2003;461-478.
9. Fiedler M. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Math. J. Praha. 25(100):1975;619-633.
10. Garey M.R., Johnson D.S., Stockmeyer L. Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1:1976;237-267.
11. S. Guattery, G. Miller, On the performance of spectral graph partitioning methods, in: Proc. 16th Annu. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM, 1995, pp. 233-242.
12. A.V. Kostochka, L.S. Melnikov, On a lower bound for the isoperimetric number of cubic graphs, in: V.F. Kolchin, et al. (Eds.), Probabilistic Methods in Discrete Mathematics, Proc. 3rd Internat. Petrozavodsk Conf., Progress in Pure and Applied Discrete Mathematics, Vol. 1, TVP/VSP, 1993, pp. 251-265.
13. Leighton F.T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. 1992;Morgan Kaufmann Publishers, Los Altos, CA.
14. Lubotzky A., Phillips R., Sarnak P. Ramanujan graphs. Combinatorica. 8(3):1988;261-277.
15. Margulis G.A. Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators. Problems Inform. Transmission. 24(1):1988;39-46.
16. Mohar B. Isoperimetric numbers of graphs. J. Combin. Theory. 47(3):1989;274-291.
17. Morgenstern M. Existence and explicit constructions of. q+1 regular ramanujan graphs for every prime power q J. Combin. Theory, Ser. B. 62(1):1994;44-62.
18. B. Monien, R. Preis, Bisection width of 3- and 4-regular graphs, in: 26th International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science, Vol. 2136, 2001, pp. 524-536.
19. Nilli A. On the second eigenvalue of a graph. Discrete Math. 91:1991;207-210.
20. Pothen A., Simon H.D., Liu K.P. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11(3):1990;430-452.
21. D.A. Spielman, S.-H. Teng, Spectral partitioning works: planar graphs and finite element meshes, in: Proc. 37th Conf. on Foundations of Computer Science, 1996, pp. 96-105.
22. Wilkinson J.H. The Algebraic Eigenvalue Problem. 1965;Oxford University Press, Oxford.