Cargando…
(p,q)-biclique counting and enumeration for large sparse bipartite graphs
In this paper, we study the problem of ([Formula: see text] , [Formula: see text] )-biclique counting and enumeration for large sparse bipartite graphs. Given a bipartite graph [Formula: see text] and two integer parameters p and q, we aim to efficiently count and enumerate all ([Formula: see text]...
Autores principales: | Yang, Jianye, Peng, Yun, Ouyang, Dian, Zhang, Wenjie, Lin, Xuemin, Zhao, Xiang |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Berlin Heidelberg
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10008723/ https://www.ncbi.nlm.nih.gov/pubmed/37362202 http://dx.doi.org/10.1007/s00778-023-00786-0 |
Ejemplares similares
-
Biclique: an R package for maximal biclique enumeration in bipartite graphs
por: Lu, Yuping, et al.
Publicado: (2020) -
On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types
por: Zhang, Yun, et al.
Publicado: (2014) -
XcisClique: analysis of regulatory bicliques
por: Pati, Amrita, et al.
Publicado: (2006) -
Faster algorithms for counting subgraphs in sparse graphs
por: Bressan, Marco
Publicado: (2021) -
Enumerating Sparse Organisms in Ships’ Ballast Water: Why Counting to 10 Is Not So Easy
por: Miller, A. Whitman, et al.
Publicado: (2011)