English

New results for the detection of bicliques

Data Structures and Algorithms 2024-12-17 v1
Authors: George Manoussakis
View on arXiv ↗ PDF ↗

Abstract

Building on existing algorithms and results, we offer new insights and algorithms for various problems related to detecting maximal and maximum bicliques. Most of these results focus on graphs with small maximum degree, providing improved complexities when this parameter is constant; a common characteristic in real-world graphs.

Keywords

biclique detection maximal bicliques maximum bicliques graph algorithms computational complexity

Cite

@article{arxiv.2412.11234,
  title  = {New results for the detection of bicliques},
  author = {George Manoussakis},
  journal= {arXiv preprint arXiv:2412.11234},
  year   = {2024}
}

Related papers

View all related →
Data Structures and Algorithms · Computer Science
A Change-Sensitive Algorithm for Maintaining Maximal Bicliques in a Dynamic Bipartite Graph
Apurba Das, Srikanta Tirthapura
2017-07-27
Data Structures and Algorithms · Computer Science
On the Efficient Discovery of Maximum $k$-Defective Biclique
Donghang Cui, Ronghua Li, Qiangqiang Dai, Hongchao Qin +1
2025-06-23
Combinatorics · Mathematics
New results for the degree/diameter problem
Michael J. Dinneen, Paul R. Hafner
2008-02-03
Data Structures and Algorithms · Computer Science
Simple, efficient maxima-finding algorithms for multidimensional samples
Wei-Mei Chen, Hsien-Kuei Hwang, Tsung-Hsi Tsai
2009-10-09
Distributed, Parallel, and Cluster Computing · Computer Science
Enumerating Maximal Bicliques from a Large Graph using MapReduce
Arko Provo Mukherjee, Srikanta Tirthapura
2014-04-22
Data Structures and Algorithms · Computer Science
BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs
Alexis Baudin, Clémence Magnien, Lionel Tabourier
2024-05-27
Data Structures and Algorithms · Computer Science
Incremental Maintenance of Maximal Cliques in a Dynamic Graph
Apurba Das, Michael Svendsen, Srikanta Tirthapura
2018-03-20
Data Structures and Algorithms · Computer Science
Maximum Flow on Highly Dynamic Graphs
Juntong Luo, Scott Sallinen, Matei Ripeanu
2023-11-14
Discrete Mathematics · Computer Science
Making Bidirected Graphs Strongly Connected
Tatsuya Matsuoka, Shun Sato
2017-09-05
Combinatorics · Mathematics
Detecting strong cliques
Ademir Hujdurović, Martin Milanič, Bernard Ries
2018-08-28
Data Structures and Algorithms · Computer Science
Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw H. Gebremedhin, Wei-keng Liao +1
2012-11-15
Combinatorics · Mathematics
Local algorithms, regular graphs of large girth, and random regular graphs
Carlos Hoppen, Nicholas Wormald
2017-03-06
Data Structures and Algorithms · Computer Science
Is it possible to find the maximum clique in general graphs?
José Ignacio Alvarez-Hamelin
2012-02-21
Data Structures and Algorithms · Computer Science
Faster Cycle Detection in the Congested Clique
Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams
2024-08-28
Data Structures and Algorithms · Computer Science
Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw H. Gebremedhin, Wei-keng Liao +1
2014-12-01
Combinatorics · Mathematics
Extremal aspects of graph and hypergraph decomposition problems
Stefan Glock, Daniela Kühn, Deryk Osthus
2021-06-28
Data Structures and Algorithms · Computer Science
Dynamic Graph Algorithms and Graph Sparsification: New Techniques and Connections
Gramoz Goranci
2019-09-17
Data Structures and Algorithms · Computer Science
Finding Cliques of a Graph using Prime Numbers
Dhananjay D. Kulkarni, Shekhar Verma, Prashant
2007-05-23
Social and Information Networks · Computer Science
A Computationally Efficient Framework for Overlapping Community Detection in Large Bipartite Graphs
Yue Zeng, Rong-Hua Li, Qiangqiang Dai, Guoren Wang
2025-12-23
Discrete Mathematics · Computer Science
New algorithms for $k$-degenerate graphs
George Manoussakis
2017-09-21
Data Structures and Algorithms · Computer Science
Computing Clique Cover with Structural Parameterization
Ahammed Ullah
2022-08-29
Discrete Mathematics · Computer Science
Tight lower bounds on the number of bicliques in false-twin-free graphs
Marina Groshaus, Leandro Montero
2016-05-12
Artificial Intelligence · Computer Science
On the Phase Transition of Finding a Biclique in a larger Bipartite Graph
Roberto Alonso, Raúl Monroy, Eduardo Aguirre
2016-09-20
Artificial Intelligence · Computer Science
A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms
Raffaele Marino, Lorenzo Buffoni, Bogdan Zavalnij
2024-03-18
Computational Complexity · Computer Science
Assessing the Computational Complexity of Multi-Layer Subgraph Detection
Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter +2
2019-10-23