Discovering Locally Maximal Bipartite Subgraphs

11/18/2022
by   Dominik Dürrschnabel, et al.
0

Induced bipartite subgraphs of maximal vertex cardinality are an essential concept for the analysis of graphs. Yet, discovering them in large graphs is known to be computationally hard. Therefore, we consider in this work a weaker notion of this problem, where we discard the maximality constraint in favor of inclusion maximality. Thus, we aim to discover locally maximal bipartite subgraphs. For this, we present three heuristic approaches to extract such subgraphs and compare their results to the solutions of the global problem. For the latter, we employ the algorithmic strength of fast SAT-solvers. Our three proposed heuristics are based on a greedy strategy, a simulated annealing approach, and a genetic algorithm, respectively. We evaluate all four algorithms with respect to their time requirement and the vertex cardinality of the discovered bipartite subgraphs on several benchmark datasets

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/06/2019

An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs

In this paper, we propose a characterization of chordal bipartite graphs...
research
03/10/2018

Efficient Enumeration of Bipartite Subgraphs in Graphs

Subgraph enumeration problems ask to output all subgraphs of an input gr...
research
07/17/2020

Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs

Given a bipartite graph, the maximum balanced biclique (MBB) problem, di...
research
04/16/2021

On the power of random greedy algorithms

In this paper we solve two problems of Esperet, Kang and Thomasse as wel...
research
03/04/2019

Faster Biclique Mining in Near-Bipartite Graphs

Identifying dense bipartite subgraphs is a common graph data mining task...
research
11/26/2021

Reconfiguration of Regular Induced Subgraphs

We study the problem of checking the existence of a step-by-step transfo...
research
10/16/2018

On Finding Dense Subgraphs in Bipartite Graphs: Linear Algorithms with Applications to Fraud Detection

Detecting dense subgraphs from large graphs is a core component in many ...

Please sign up or login with your details

Forgot password? Click here to reset