Scale Reduction Techniques for Computing Maximum Induced Bicliques
AbstractGiven a simple, undirected graph G, a biclique is a subset of vertices inducing a complete bipartite subgraph in G. In this paper, we consider two associated optimization problems, the maximum biclique problem, which asks for a biclique of the maximum cardinality in the graph, and the maximum edge biclique problem, aiming to find a biclique with the maximum number of edges in the graph. These NP-hard problems find applications in biclustering-type tasks arising in complex network analysis. Real-life instances of these problems often involve massive, but sparse networks. We develop exact approaches for detecting optimal bicliques in large-scale graphs that combine effective scale reduction techniques with integer programming methodology. Results of computational experiments with numerous real-life network instances demonstrate the performance of the proposed approach. View Full-Text
Share & Cite This Article
Shahinpour, S.; Shirvani, S.; Ertem, Z.; Butenko, S. Scale Reduction Techniques for Computing Maximum Induced Bicliques. Algorithms 2017, 10, 113.
Shahinpour S, Shirvani S, Ertem Z, Butenko S. Scale Reduction Techniques for Computing Maximum Induced Bicliques. Algorithms. 2017; 10(4):113.Chicago/Turabian Style
Shahinpour, Shahram; Shirvani, Shirin; Ertem, Zeynep; Butenko, Sergiy. 2017. "Scale Reduction Techniques for Computing Maximum Induced Bicliques." Algorithms 10, no. 4: 113.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.