The Maximum Induced Bipartite Subgraph Problem with Edge Weights

DOI10.1137/060650015zbMath1141.05076OpenAlexW2063312969MaRDI QIDQ3519200

Denis Cornaz, Ali Ridha Mahjoub

Publication date: 13 August 2008

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/aaf0ea18065c19aad2a2ee4a40e9678e9844b7cd

zbMATH Keywords

polytopeseparation algorithmedge weightminimal dependent setinduced bipartite subgraph

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

The minimum chromatic violation problem: a polyhedral approach ⋮ Minimal arc-sets spanning dicycles ⋮ On co-bicliques ⋮ Perfectly matchable subgraph problem on a bipartite graph ⋮ Cycle transversals in bounded degree graphs

This page was built for publication: The Maximum Induced Bipartite Subgraph Problem with Edge Weights