A linear programming formulation for the maximum complete multipartite subgraph problem

DOI10.1007/S10107-005-0656-6zbMATH Open1079.05093OpenAlexW2113271203MaRDI QIDQ2583129FDOQ2583129

Authors: Denis Cornaz 

Publication date: 13 January 2006

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-005-0656-6

Recommendations

• The Maximum Induced Bipartite Subgraph Problem with Edge Weights
• On bipartite and multipartite clique problems
• Approximating element-weighted vertex deletion problems for the complete \(k\)-partite property
• scientific article; zbMATH DE number 26478
• scientific article; zbMATH DE number 15357

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Boolean programming (90C09)

Cites Work

• The ellipsoid method and its consequences in combinatorial optimization
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The maximum edge biclique problem is NP-complete
• Title not available (Why is that?)
• Bipartite dimensions and bipartite degrees of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Chromatic characterization of biclique covers
• Title not available (Why is that?)
• Sharp bounds for decompositions of graphs into completer-partite subgraphs
• Edge partitions of complete multipartite graphs into equal length circuits

Cited In (3)

• The Maximum Induced Bipartite Subgraph Problem with Edge Weights
• An Integer Programming Formulation for the Maximum k-Subset Intersection Problem
• On co-bicliques

This page was built for publication: A linear programming formulation for the maximum complete multipartite subgraph problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583129)