On Partitioning Grids into Equal Parts
S. L. Bezrukov ; B. Rovan
Computing and Informatics, Tome 28 (2012) no. 1, / Harvested from Computing and Informatics
Text on Computing and Informatics
Let an edge cut partition the vertex set of an n-dimensional quadratic grid with the side length a into k subsets A1, … , Ak with ... . We consider the problem of determining the minimal size c (n,k,a) of such a cut and present its asymptotic c (n,k,a) ~ nan-1  as a, k ®   and k/an ® 0. The same asymptotic holds for partitioning of the n-dimensional torus. We present also some heuristics, which provide better partitioning for n = 2 and small k.
Publié le : 2012-01-26
Classification:  
@article{cai666,
     author = {S. L. Bezrukov and B. Rovan},
     title = {On Partitioning Grids into Equal Parts},
     journal = {Computing and Informatics},
     volume = {28},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai666}
}

S. L. Bezrukov; B. Rovan. On Partitioning Grids into Equal Parts. Computing and Informatics, Tome 28 (2012) no. 1, . http://gdmltest.u-ga.fr/item/cai666/