Efficient Enumeration of Bipartite Subgraphs in Graphs

03/10/2018
by   Kunihiro Wasa, et al.
0

Subgraph enumeration problems ask to output all subgraphs of an input graph that belongs to the specified graph class or satisfy the given constraint. These problems have been widely studied in theoretical computer science. As far, many efficient enumeration algorithms for the fundamental substructures such as spanning trees, cycles, and paths, have been developed. This paper addresses the enumeration problem of bipartite subgraphs. Even though bipartite graphs are quite fundamental and have numerous applications in both theory and application, its enumeration algorithms have not been intensively studied, to the best of our knowledge. We propose the first non-trivial algorithms for enumerating all bipartite subgraphs in a given graph. As the main results, we develop two efficient algorithms: the one enumerates all bipartite induced subgraphs of a graph with degeneracy k in O(k) time per solution. The other enumerates all bipartite subgraphs in O(1) time per solution.

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
08/05/2007

Network synchronizability analysis: the theory of subgraphs and complementary graphs

In this paper, subgraphs and complementary graphs are used to analyze th...
research
11/26/2021

Reconfiguration of Regular Induced Subgraphs

We study the problem of checking the existence of a step-by-step transfo...
research
11/18/2022

Discovering Locally Maximal Bipartite Subgraphs

Induced bipartite subgraphs of maximal vertex cardinality are an essenti...
research
01/04/2021

Searching Personalized k-wing in Large and Dynamic Bipartite Graphs

There are extensive studies focusing on the application scenario that al...
research
09/02/2018

Mining Frequent Patterns in Evolving Graphs

Given a labeled graph, the frequent-subgraph mining (FSM) problem asks t...
research
05/16/2018

Investigating the Agility Bias in DNS Graph Mining

The concept of agile domain name system (DNS) refers to dynamic and rapi...

Please sign up or login with your details

Forgot password? Click here to reset