Efficient Algorithms for Maximal k-Biplex Enumeration

by   Kaiqiang Yu, et al.

Mining maximal subgraphs with cohesive structures from a bipartite graph has been widely studied. One important cohesive structure on bipartite graphs is k-biplex, where each vertex on one side disconnects at most k vertices on the other side. In this paper, we study the maximal k-biplex enumeration problem which enumerates all maximal k-biplexes. Existing methods suffer from efficiency and/or scalability issues and have the time of waiting for the next output exponential w.r.t. the size of the input bipartite graph (i.e., an exponential delay). In this paper, we adopt a reverse search framework called bTraversal, which corresponds to a depth-first search (DFS) procedure on an implicit solution graph on top of all maximal k-biplexes. We then develop a series of techniques for improving and implementing this framework including (1) carefully selecting an initial solution to start DFS, (2) pruning the vast majority of links from the solution graph of bTraversal, and (3) implementing abstract procedures of the framework. The resulting algorithm is called iTraversal, which has its underlying solution graph significantly sparser than (around 0.1 of polynomial delay. Our experimental results on real and synthetic graphs, where the largest one contains more than one billion edges, show that our algorithm is up to four orders of magnitude faster than existing algorithms.


page 1

page 2

page 3

page 4


Proximity Search For Maximal Subgraph Enumeration

This paper considers the subgraphs of an input graph that satisfy a give...

Polynomial-Delay Enumeration of Large Maximal Matchings

Enumerating matchings is a classical problem in the field of enumeration...

Fairness-aware Maximal Biclique Enumeration on Bipartite Graphs

Maximal biclique enumeration is a fundamental problem in bipartite graph...

A Change-Sensitive Algorithm for Maintaining Maximal Bicliques in a Dynamic Bipartite Graph

We consider the maintenance of maximal bicliques from a dynamic bipartit...

Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach

Enumerating maximal k-biplexes (MBPs) of a bipartite graph has been used...

Efficient Bitruss Decomposition for Large-scale Bipartite Graphs

Cohesive subgraph mining in bipartite graphs becomes a popular research ...

Faster Biclique Mining in Near-Bipartite Graphs

Identifying dense bipartite subgraphs is a common graph data mining task...

Please sign up or login with your details

Forgot password? Click here to reset