The Maximum Induced Bipartite Subgraph Problem with Edge Weights
From MaRDI portal
Recommendations
Cited in
(15)- Compositions in the bipartite subgraph polytope
- Minimal arc-sets spanning dicycles
- The minimum chromatic violation problem: a polyhedral approach
- Polyhedral results for the bipartite induced subgraph problem
- Boundary graph classes for some maximum induced subgraph problems
- A linear programming formulation for the maximum complete multipartite subgraph problem
- Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
- Cycle transversals in bounded degree graphs
- On co-bicliques
- Perfectly matchable subgraph problem on a bipartite graph
- The Maximum Weight Connected Subgraph Problem
- Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
- Mixed-Integer Vertex Covers on Bipartite Graphs
- Maximum bipartite subgraphs of geometric intersection graphs
- Maximum weighted edge biclique problem on bipartite graphs
This page was built for publication: The Maximum Induced Bipartite Subgraph Problem with Edge Weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519200)