Parameterized Algorithms for Maximum Edge Biclique and Related Problems

Qi, Feng; Zhou, Zeyang; Wang, Jianxin

doi:10.1007/978-3-319-39817-4_8

Cited by 1 publication

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More specifically, Lin [37] has proved that the problem of deciding whether a given graph G contains a complete bipartite subgraph K k,k is W[1]-hard, meaning that an fpt-algorithm is unlikely to exist. In another recent paper, Feng et al [38] studied the parameterized edge biclique problem, which asks if a given bipartite graph G contains a biclique subgraph with at least k edges, where k is a given integer parameter. To the best of our knowledge, the MB and MEB problems considered in this paper have not been studied from a parameterized complexity perspective and the exact approach proposed in this paper is the first reported attempt of solving these problems computationally.…”

Section: Introductionmentioning

confidence: 99%

Scale Reduction Techniques for Computing Maximum Induced Bicliques

et al. 2017

View full text Add to dashboard Cite

Given 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.

show abstract

Section: Introductionmentioning

confidence: 99%