The Isoperimetric Number of d-Dimensional k-Ary Arrays
暂无分享,去创建一个
[1] M Cemil,et al. Isoperimetric Number of the Cartesian Product of Graphs and Paths , .
[2] Da-Lun Wang,et al. Discrete Isoperimetric Problems , 1977 .
[3] Béla Bollobás,et al. Edge-isoperimetric inequalities in the grid , 1991, Comb..
[4] Oliver Riordan. An Ordering on the Even Discrete Torus , 1998, SIAM J. Discret. Math..
[5] Rudolf Ahlswede,et al. Edge isoperimetric theorems for integer point arrays , 1995 .
[6] Bojan Mohar,et al. Isoperimetric numbers of graphs , 1989, J. Comb. Theory, Ser. B.
[7] Fan Chung Graham,et al. Isoperimetric Inequalities for Cartesian Products of Graphs , 1998, Comb. Probab. Comput..
[8] L. H. Harper. Optimal Assignments of Numbers to Vertices , 1964 .
[9] John H. Lindsey,et al. Assignment of Numbers to Vertices , 1964 .
[10] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .
[11] Béla Bollobás,et al. An Isoperimetric Inequality on the Discrete Torus , 1990, SIAM J. Discret. Math..