On co-bicliques
From MaRDI portal
Publication:3004204
DOI10.1051/ro:2007020zbMath1227.90043OpenAlexW2131512343MaRDI QIDQ3004204
Publication date: 1 June 2011
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/105376
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Boolean programming (90C09) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Chromatic characterization of biclique covers
- A linear programming formulation for the maximum complete multipartite subgraph problem
- The Maximum Induced Bipartite Subgraph Problem with Edge Weights
- Clique-connecting forest and stable set polytopes