The Graph Partitioning Polytope on Series-Parallel and 4-Wheel Free Graphs

DOI10.1137/S0895480191199415zbMATH Open0797.05073MaRDI QIDQ4287936FDOQ4287936

Authors: Sunil Chopra 

Publication date: 12 May 1994

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Recommendations

• Facet-defining inequalities for the simple graph partitioning polytope
• The partition problem
• On the stable set polytope of a series-parallel graph
• Facets of the Bipartite Subgraph Polytope

zbMATH Keywords

4-wheel free graphgraph partitioning polytope

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph theory (05C99)

Cited In (12)

• An overview of graph covering and partitioning
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
• Circuit and bond polytopes on series-parallel graphs
• Arborescence polytopes for series-parallel graphs
• Projection results for the \(k\)-partition problem
• Cardinality constrained Boolean quadratic polytope
• A polyhedral study of lifted multicuts
• Trader multiflow and box-TDI systems in series-parallel graphs
• Min-cut clustering
• Cliques and clustering: A combinatorial approach
• Max-multiflow/min-multicut for G+H series-parallel
• Improved compact formulations for a wide class of graph partitioning problems in sparse graphs

This page was built for publication: The Graph Partitioning Polytope on Series-Parallel and 4-Wheel Free Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287936)