Pages that link to "Item:Q496657"
From MaRDI portal
The following pages link to Solving the maximum edge biclique packing problem on unbalanced bipartite graphs (Q496657):
Displaying 11 items.
- New heuristic approaches for maximum balanced biclique problem (Q781924) (← links)
- Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs (Q1749486) (← links)
- The biclique partitioning polytope (Q2032987) (← links)
- General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem (Q2177818) (← links)
- Scale reduction techniques for computing maximum induced bicliques (Q2633172) (← links)
- Parameterized algorithms for edge biclique and related problems (Q2636505) (← links)
- An Integer Programming Formulation for the Maximum k-Subset Intersection Problem (Q3195319) (← links)
- Parameterized Algorithms for Maximum Edge Biclique and Related Problems (Q4632171) (← links)
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← links)
- (Q4691855) (← links)
- On Problem of Finding all Maximal Induced Bicliques of Hypergraph (Q5071398) (← links)