On \(k\)-partitioning the \(n\)-cube

DOI10.1007/3-540-62559-3_5zbMath1539.68208MaRDI QIDQ6550531

Sergei L. Bezrukov

Publication date: 5 June 2024

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• A Separator Theorem for Planar Graphs
• Theoretical Aspects of VLSI Pin Limitations
• COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗
• Optimal Assignments of Numbers to Vertices

This page was built for publication: On \(k\)-partitioning the \(n\)-cube