Pages that link to "Item:Q1122491"
From MaRDI portal
The following pages link to Facets of the balanced (acyclic) induced subgraph polytope (Q1122491):
Displaying 11 items.
- A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem (Q342319) (← links)
- Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453) (← links)
- Separator-based data reduction for signed graph balancing (Q613659) (← links)
- An exact approach to the problem of extracting an embedded network matrix (Q716336) (← 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)
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut (Q2299984) (← links)
- The maximum balanced subgraph of a signed graph: applications and solution approaches (Q2356257) (← links)
- A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph (Q2414463) (← links)
- Polyhedral results for the bipartite induced subgraph problem (Q2433802) (← links)
- Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs (Q2813347) (← links)
