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

07/26/2017
by   Apurba Das, et al.
0

We consider the maintenance of maximal bicliques from a dynamic bipartite graph that changes over time due to the addition or deletion of edges. When the set of edges in a graph changes, we are interested in knowing the change in the set of maximal bicliques (the "change"), rather than in knowing the set of maximal bicliques that remain unaffected. The challenge in an efficient algorithm is to enumerate the change without explicitly enumerating the set of all maximal bicliques. In this work, we present (1) near-tight bounds on the magnitude of change in the set of maximal bicliques of a graph, due to a change in the edge set (2) a "change-sensitive" algorithm for enumerating the change in the set of maximal bicliques, whose time complexity is proportional to the magnitude of change that actually occurred in the set of maximal bicliques in the graph. To our knowledge, these are the first algorithms for enumerating maximal bicliques in a dynamic graph, with such provable performance guarantees. Our algorithms are easy to implement, and experimental results show that their performance exceeds that of current baseline implementations by orders of magnitude.

READ FULL TEXT
research
06/23/2019

Dynamic Maximal Independent Set

Given a stream S of insertions and deletions of edges of an underlying g...
research
12/29/2021

Efficient Algorithms for Maximal k-Biplex Enumeration

Mining maximal subgraphs with cohesive structures from a bipartite graph...
research
04/24/2018

Improved Algorithms for Fully Dynamic Maximal Independent Set

Maintaining maximal independent set in dynamic graph is a fundamental op...
research
02/27/2018

Fully Dynamic Maximal Independent Set with Sublinear Update Time

A maximal independent set (MIS) can be maintained in an evolving m-edge ...
research
10/26/2018

Mining Maximal Induced Bicliques using Odd Cycle Transversals

Many common graph data mining tasks take the form of identifying dense s...
research
03/20/2023

MAD-FC: A Fold Change Visualization with Readability, Proportionality, and Symmetry

We propose a fold change visualization that demonstrates a combination o...
research
10/28/2021

Finding a Concise, Precise, and Exhaustive Set of Near Bi-Cliques in Dynamic Graphs

A variety of tasks on dynamic graphs, including anomaly detection, commu...

Please sign up or login with your details

Forgot password? Click here to reset