The Optimal Partitioning of Graphs

DOI10.1137/0130006zbMATH Open0321.05123OpenAlexW1971834712MaRDI QIDQ4083702FDOQ4083702

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)

• 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
• On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint
• Partitioning of sequentially ordered systems using linear programming
• Title not available (Why is that?)
• Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée
• An exact approach for the multi-constraint graph partitioning problem
• 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)