Pages that link to "Item:Q1749486"
From MaRDI portal
The following pages link to Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs (Q1749486):
Displaying 7 items.
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs (Q496657) (← links)
- New heuristic approaches for maximum balanced biclique problem (Q781924) (← links)
- Computing maximum \(k\)-defective cliques in massive graphs (Q2026994) (← links)
- General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem (Q2177818) (← links)
- An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem (Q2242188) (← links)
- Near optimal solutions for maximum quasi-bicliques (Q2377385) (← links)
- Scale reduction techniques for computing maximum induced bicliques (Q2633172) (← links)