On some weakly bipartite graphs
DOI10.1016/0167-6377(83)90031-7zbMATH Open0549.90087OpenAlexW2055365041MaRDI QIDQ800231FDOQ800231
Authors: Francisco Barahona 
Publication date: 1983
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(83)90031-7
polyhedral combinatoricsellipsoid methodmax- cut problemminimum two-commodity cutweakly bipartite graphs
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Integer programming (90C10) Polytopes and polyhedra (52Bxx)
Cites Work
- Title not available (Why is that?)
- The ellipsoid method and its consequences in combinatorial optimization
- On the cut polytope
- Blocking and anti-blocking pairs of polyhedra
- The matroids with the max-flow min-cut property
- Multi-Commodity Network Flows
- Weakly bipartite graphs and the max-cut problem
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- The max-cut problem on graphs not contractible to \(K_ 5\)
- Facets of the Bipartite Subgraph Polytope
Cited In (16)
- Title not available (Why is that?)
- Optimal cuts in graphs and statistical mechanics
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On weakly diamond-free Berge graphs
- Compositions in the bipartite subgraph polytope
- Laplacian eigenvalues and the maximum cut problem
- On bipartite graphs with weak density of some subgraphs
- On Principal Graphs and Weak Duality.
- On bipartite‐mixed graphs
- Some optimization problems on weak-bisplit graphs
- On cuts and matchings in planar graphs
- Title not available (Why is that?)
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs
- Weakly clique irreducibility of NEPS of two graphs
This page was built for publication: On some weakly bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800231)
