A linear programming formulation for the maximum complete multipartite subgraph problem
From MaRDI portal
Publication:2583129
Recommendations
Cites work
- scientific article; zbMATH DE number 26478 (Why is no real title available?)
- scientific article; zbMATH DE number 3582190 (Why is no real title available?)
- scientific article; zbMATH DE number 786153 (Why is no real title available?)
- scientific article; zbMATH DE number 790476 (Why is no real title available?)
- Bipartite dimensions and bipartite degrees of graphs
- Chromatic characterization of biclique covers
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Edge partitions of complete multipartite graphs into equal length circuits
- Sharp bounds for decompositions of graphs into completer-partite subgraphs
- The ellipsoid method and its consequences in combinatorial optimization
- The maximum edge biclique problem is NP-complete
Cited in
(3)
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)