On k-partitioning of Hamming graphs

Discrete Applied Mathematics

Volumn 95, Issue 1-3, 1999, Pages 127-140

  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

Edge isoperimetric problem; Graph partitioning; Hamming graphs; Hypercubes

Indexed keywords

EID: 0042779808     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00070-0     Document Type: Article

References (11)

1. R. Ahlswede, N. Cai, General edge-isoperimetric inequalities, Part II: a Local-Global Principle for Lexicographical Solutions, Eur. J. Combin. 18 (1997) 479-489.
2. S.L. Bezrukov, On k-partitioning of the n-cube, Proceedings Graph-Theoretic Concepts in Computer Science WG'96, 1997, pp. 44-55.
3. S.L. Bezrukov, B. Rovan, On partitioning grids into equal parts, Comput. Artif. Intell. 16 (1997) 153-165.
4. F.R.K. Chung, S.-T. Yao, A near optimal algorithm for edge separators, Proceedings of the 26th ACM Symp. Theory of Computing, 1994, pp. 1-8.
5. R. Cypher, Theoretical aspects of VLSI pin limitations, SIAM J. Comput. 22 (1993) 356-378.
6. R. Diekmann, R. Lüling, B. Monien, C. Spräner, Combining helpful sets and Parallel simulated annealing for the graph-partitioning problem, Int. J. Parallel Algorithms Appl. 8 (1996) 61-84.
7. J.R. Gilbert, G.L. Miller, S.-H. Teng, Geometric mesh partitioning: Implementation and experiments, Proceedings IPPS'95, 1995, pp. 418-427.
8. J.H. Lindsey II, Assignment of numbers to vertices, Amer. Math. Monthly 7 (1964) 508-516.
9. R.J. Lipton, R.E. Tarjan, A Separator theorem for planar graphs, SIAM J. Appl. Math. 36 (1979) 177-189.
10. J. Rolim, O. Sýkora, I. Vrt'o, Optimal cutwidth and bisection width of 2-and 3-dimensional meshes, Proceedings Graph-Theoretic Concepts in Computer Science WG'95, 1995, pp. 252-264.
11. E.J. Schwabe, Optimality of a VLSI decomposition scheme for the De-Bruijn graph, Parallel Process. Lett. 3 (1993) 261-265.