scientific article; zbMATH DE number 1026281

MaRDI QIDQ4342906zbMATH OpenFDO

Authors Sergej L. Bezrukov, Branislav Rovan

Publication date 5 October 1997

zbMATH Keywords

grid partitioning

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On a 2-dimensional equipartition problem
• scientific article; zbMATH DE number 3891429
• Max-min partitioning of grid graphs into connected components
• Fast balanced partitioning is hard even on grids and trees
• On \(k\)-partitioning of Hamming graphs

Cited in

(6)

• Splitting numbers of grids
• Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles
• Full friendly index set. I
• scientific article; zbMATH DE number 749666 (Why is no real title available?)
• On k-partitioning the n-cube
• Partitioning datasets based on equalities among parameters

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4342906)