On bounds for the k-partitioning of graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1627, Issue , 1999, Pages 154-163

  Bezrukov, S L ^a   Elsasser R ^b   Schroeder, U P ^b  

^a UNIVERSITY OF WISCONSIN SUPERIOR   (United States)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EDGE CUTS; EXTREMAL; GRAPH CLASS; HAMMING GRAPHS; LOWER BOUND METHOD; SET PROBLEMS; VERTEX SET;

COMBINATORIAL MATHEMATICS;

EID: 84957797576     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48686-0_15     Document Type: Conference Paper

References (16)

1. Bezrukov S.L.: On k-partitioning the n-cube. In: Proceedings Graph-Theoretic Concepts in Computer Science WG’96, LNCS 1197, Springer Verlag (1997), 44-55.
2. Bezrukov S.L.: Isoperimetric Problems in Discrete Spaces. In: Extremal Problems for Finite Set, Bolyai Soc. Math. Stud. 3, ed.: P. Frankl, Z. Furedi, G. Katona, D. Miklos, Budapest (1994), 59-91.
3. Bezrukov S.L.: Edge isoperimetric problems on graphs (a survey). To appear in Graph Theory and Combinatorial Biology, Bolyai Soc. Math. Stud. 7, ed.: L. Lo-vasz, A. Gyarfas, G. Katona, A. Recski, L. Szekely, Budapest.
4. Bezrukov S.L., Elsässer R., Schroeder U.-P.: On k-Partitioning of Hamming Graphs. To appear in Discrete Applied Mathematics.
5. Chung F.R.K.: Spectral Graph Theory. American Mathematical Society, Regional Conference Series in Mathematics 92 (1997).
6. Cypher R.: Theoretical Aspects of VLSI Pin Limitations. SIAM J. Comput. 22 (1993), 356-378.
7. Donath W.E., Hoffman A.J.: Lower Bounds for the Partitioning of Graphs. IBM J. Res. Develop. 17 (1973), 420-425.
8. Hendrickson B., Leland R.: The chaco user’s guide: Version 2.0. Technical Report SAND94-2692, Sandia National Laboratories, Albuquerque, NM, (1994).
9. Karypis G., Kumar V.: A fast and high quality multilevel scheme for partitioning irregular graphs. Technical Report 95-035, University of Minnesota, (1995).
10. Lindsey II J.H.: Assignment of numbers to vertices. Amer. Math. Monthly 7 (1964), 508-516.
11. Lipton R.J., Tarjan R.E.: A Separator Theorem for Planar Graphs. SIAM J. Appl. Math. 36 (1979), 177-189.
12. Preis R., Diekmann R.: PARTY - A Software Library for Graph Partitioning. Advances in Computational Mechanics with Parallel and Distributed Processing, ed.: B.H.V. Topping, Civil-Comp Press (1997), 63-71.
13. Pellegrini F., Roman J.: Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs. In: Proc. of HPCN’96, LNCS 1067, Springer Verlag (1996), 493-498.
14. Rolim J., Sykora O., Vrto I.: Optimal Cutwidth and Bisection Width of 2- and 3-Dimensional Meshes. In: Proc. of WG’95, LNCS 1017, Springer Verlag (1995), 252-264.
15. Schwabe E.J.: Optimality of a VLSI Decomposition Scheme for the De-Bruijn Graph. Parallel Process. Lett. 3 (1993), 261-265.
16. Walshaw C., Cross M., Everett M.G.: A localised algorithm for optimising unstructured mesh partitions. Int. J. Supercomputer Appl. 9(4) (1995), 280-295.