Pages that link to "Item:Q2427696"
From MaRDI portal
The following pages link to Biclique completion problems for multicast network design (Q2427696):
Displayed 8 items.
- On solving manufacturing cell formation via bicluster editing (Q323416) (← links)
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs (Q496657) (← links)
- The biclique partitioning polytope (Q2032987) (← links)
- Semidefinite Programming and Constraint Programming (Q2802541) (← links)
- The biclique k-clustering problem in bipartite graphs and its application in bioinformatics (Q2883562) (← links)
- On star and biclique edge-colorings (Q2968507) (← links)
- A branch‐and‐price approach to <i>k</i>‐clustering minimum biclique completion problem (Q4921257) (← links)
- An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems (Q5356965) (← links)