The Optimal Partitioning of Graphs

DOI10.1137/0130006MaRDI QIDQ4083702zbMATH OpenOpenAlexFDO

Authors

Publication date 1976

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0130006

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99) Operations research and management science (90B99)

Cited in

(14)

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

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)