Pages that link to "Item:Q1199475"
From MaRDI portal
The following pages link to Compositions in the bipartite subgraph polytope (Q1199475):
Displaying 21 items.
- Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453) (← links)
- Small bipartite subgraph polytopes (Q613319) (← links)
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs (Q686456) (← links)
- On cuts and matchings in planar graphs (Q688915) (← links)
- Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem (Q969344) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- On a composition of independence systems by circuit identification (Q1186136) (← links)
- Compositions in the bipartite subgraph polytope (Q1199475) (← links)
- Facets for the cut cone. I (Q1199749) (← links)
- Laplacian eigenvalues and the maximum cut problem (Q1319025) (← links)
- One-node cutsets and the dominating set polytope (Q1356733) (← links)
- The maximum cardinality cut problem in co-bipartite chain graphs (Q1698075) (← links)
- On graphs of the cone decompositions for the min-cut and max-cut problems (Q1751487) (← links)
- Composition of graphs and the triangle-free subgraph polytope (Q1810860) (← links)
- A characterization of weakly bipartite graphs (Q1850558) (← links)
- Applications of cut polyhedra. II (Q1891020) (← links)
- One-third-integrality in the max-cut problem (Q1924057) (← links)
- Polyhedral results for the bipartite induced subgraph problem (Q2433802) (← links)
- Composition of graphs and the triangle free subgraph polytope (Q2816057) (← links)
- Facets of the Bipartite Subgraph Polytope (Q3699730) (← links)
- Approximating Unique Games Using Low Diameter Graph Decomposition (Q5002621) (← links)
