The Optimal Partitioning of Graphs

DOI10.1137/0130006MaRDI QIDQ4083702zbMATHOpenAlexFDO

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

(12)

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

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)