Cited in
(14)- Spectral methods for graph bisection problems.
- A projection technique for partitioning the nodes of a graph
- Spectral bounds for graph partitioning with prescribed partition sizes
- A survey of constrained classification
- On the magnetisation of the ground states in two dimensional Ising spin glasses
- Optimizing connected components graph partitioning with minimum size constraints using integer programming and spectral clustering techniques
- On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint
- Multilevel iterated tabu search for the multi-constraint graph partitioning problem
- Partitioning of sequentially ordered systems using linear programming
- scientific article; zbMATH DE number 3770975 (Why is no real title available?)
- An exact approach for the multi-constraint graph partitioning problem
- Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
This page was built for publication: The Optimal Partitioning of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4083702)
