Pages that link to "Item:Q2433802"
From MaRDI portal
The following pages link to Polyhedral results for the bipartite induced subgraph problem (Q2433802):
Displayed 7 items.
- Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453) (← links)
- The maximum \(k\)-colorable subgraph problem and orbitopes (Q666000) (← links)
- Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph (Q972337) (← links)
- The minimum chromatic violation problem: a polyhedral approach (Q2184668) (← links)
- A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems (Q2883604) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- Two generalizations of proper coloring: hardness and approximability (Q6168932) (← links)