Scale reduction techniques for computing maximum induced bicliques
From MaRDI portal
Publication:2633172
DOI10.3390/a10040113zbMath1461.05221OpenAlexW2762373010MaRDI QIDQ2633172
Shahram Shahinpour, Zeynep Ertem, Shirin Shirvani, Sergiy I. 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
Applications of graph theory (05C90) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
- Consensus algorithms for the generation of all maximal bicliques
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- Enumeration aspects of maximal cliques and bicliques
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- Arboricity and bipartite subgraph listing algorithms
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- The maximum edge biclique problem is NP-complete
- A fast algorithm for the maximum clique problem
- Maximum weight relaxed cliques and Russian doll search revisited
- Finding maximum edge bicliques in convex bipartite graphs
- Exact exponential-time algorithms for finding bicliques
- On clique relaxation models in network analysis
- On Bipartite and Multipartite Clique Problems
- On the Power of Simple Reductions for the Maximum Independent Set Problem
- Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
- Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
- A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
- Inapproximability of Maximum Weighted Edge Biclique and Its Applications
- Approximating Clique and Biclique Problems
- Parameterized Algorithms for Maximum Edge Biclique and Related Problems
- The Parameterized Complexity of k-B<scp>iclique</scp>
- Node-and edge-deletion NP-complete problems
- Parameterized Algorithms
This page was built for publication: Scale reduction techniques for computing maximum induced bicliques
