Scale reduction techniques for computing maximum induced bicliques
DOI10.3390/A10040113zbMATH Open1461.05221OpenAlexW2762373010MaRDI QIDQ2633172FDOQ2633172
Authors: Shahram Shahinpour, Shirin Shirvani, Zeynep Ertem, Sergiy Butenko 
Publication date: 8 May 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a10040113
Recommendations
- On problem of finding all maximal induced bicliques of hypergraph
- Solving the maximum clique and vertex coloring problems on very large sparse networks
- Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
- The biclique \(k\)-clustering problem in bipartite graphs and its application in bioinformatics
- Efficient enumeration of maximal induced bicliques
Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Parameterized algorithms
- A fast algorithm for the maximum clique problem
- On clique relaxation models in network analysis
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- Title not available (Why is that?)
- The parameterized complexity of \(k\)-biclique
- Node-and edge-deletion NP-complete problems
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- On bipartite and multipartite clique problems
- Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
- The maximum edge biclique problem is NP-complete
- A simple and faster branch-and-bound algorithm for finding a maximum clique
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- Exact exponential-time algorithms for finding bicliques
- Approximating Clique and Biclique Problems
- Consensus algorithms for the generation of all maximal bicliques
- Inapproximability of Maximum Weighted Edge Biclique and Its Applications
- Enumeration aspects of maximal cliques and bicliques
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
- Title not available (Why is that?)
- Solving the maximum clique and vertex coloring problems on very large sparse networks
- Arboricity and bipartite subgraph listing algorithms
- Finding maximum edge bicliques in convex bipartite graphs
- Parameterized Algorithms for Maximum Edge Biclique and Related Problems
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- On the power of simple reductions for the maximum independent set problem
- Maximum weight relaxed cliques and Russian doll search revisited
Cited In (5)
- Solving the maximum clique and vertex coloring problems on very large sparse networks
- The bipartite QUBO
- Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
- On problem of finding all maximal induced bicliques of hypergraph
- Highly bi-connected subgraphs for computational protein function annotation
Uses Software
This page was built for publication: Scale reduction techniques for computing maximum induced bicliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2633172)
