Maximal biclique subgraphs and closed pattern pairs of the adjacency matrix: A one-to-one correspondence and mining algorithms
Maximal biclique (also known as complete bipartite) subgraphs can model many
applications in Web mining, business, and bioinformatics. Enumerating maximal biclique …
applications in Web mining, business, and bioinformatics. Enumerating maximal biclique …
Shared-memory parallel maximal clique enumeration
A Das, SV Sanei-Mehri… - 2018 IEEE 25th …, 2018 - ieeexplore.ieee.org
We present shared-memory parallel methods for Maximal Clique Enumeration (MCE) from a
graph. MCE is a fundamental and well-studied graph analytics task, and is a widely used …
graph. MCE is a fundamental and well-studied graph analytics task, and is a widely used …
Enumeration of enumeration algorithms
K Wasa - arxiv preprint arxiv:1605.05102, 2016 - arxiv.org
arxiv:1605.05102v2 [cs.DS] 25 May 2016 Page 1 arxiv:1605.05102v2 [cs.DS] 25 May 2016
Enumeration of Enumeration Algorithms Kunihiro Wasa∗ May 26, 2016 Abstract In this paper …
Enumeration of Enumeration Algorithms Kunihiro Wasa∗ May 26, 2016 Abstract In this paper …
Enumerating maximal bicliques from a large graph using mapreduce
We consider the enumeration of maximal bipartite cliques (bicliques) from a large graph, a
task central to many data mining problems arising in social network analysis and …
task central to many data mining problems arising in social network analysis and …
[HTML][HTML] Enumeration aspects of maximal cliques and bicliques
We present a general framework to study enumeration algorithms for maximal cliques and
maximal bicliques of a graph. Given a graph G, we introduce the notion of the transition …
maximal bicliques of a graph. Given a graph G, we introduce the notion of the transition …
Efficient maintenance for maximal bicliques in bipartite graph streams
Z Ma, Y Liu, Y Hu, J Yang, C Liu, H Dai - World Wide Web, 2022 - Springer
Maximal biclique enumeration is a fundamental problem in analysing bipartite graphs, which
has a wide range of real applications, such as web mining, recommendation systems, and …
has a wide range of real applications, such as web mining, recommendation systems, and …
Efficient enumeration of maximal induced bicliques
D Hermelin, G Manoussakis - Discrete Applied Mathematics, 2021 - Elsevier
Given a graph G of order n, we consider the problem of enumerating all its maximal induced
bicliques. We first propose an algorithm running in time O (n 3 n/3). As the maximum number …
bicliques. We first propose an algorithm running in time O (n 3 n/3). As the maximum number …
Biclique graphs and biclique matrices
A biclique of a graph G is a maximal induced complete bipartite subgraph of G. Given a
graph G, the biclique matrix of G is a {0, 1,− 1} matrix having one row for each biclique and …
graph G, the biclique matrix of G is a {0, 1,− 1} matrix having one row for each biclique and …
[BOOK][B] Exponential Time Algorithms
S Gaspers - 2010 - books.google.com
This book studies exponential time algorithms for NP-hard problems. In this modern area,
the aim is to design algorithms for combinatorially hard problems that execute provably …
the aim is to design algorithms for combinatorially hard problems that execute provably …
Algorithm for Mining Maximal Balanced Bicliques using Formal Concept Analysis
One of the most fundamental models for cohesive subgraph mining in network analysis is
that which involves the use of cliques. In bipartite graph analysis, the detection of maximal …
that which involves the use of cliques. In bipartite graph analysis, the detection of maximal …