The Optimal Partitioning of Graphs
From MaRDI portal
Publication:4083702
DOI10.1137/0130006zbMath0321.05123OpenAlexW1971834712MaRDI QIDQ4083702
No author found.
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
Extremal problems in graph theory (05C35) Operations research and management science (90B99) Graph theory (05C99)
Related Items
On the magnetisation of the ground states in two dimensional Ising spin glasses, Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée, A survey of constrained classification, A projection technique for partitioning the nodes of a graph, 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 methods for graph bisection problems., An exact approach for the multi-constraint graph partitioning problem, Unnamed Item, 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, Spectral bounds for graph partitioning with prescribed partition sizes
