(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]...

Descripción completa

Detalles Bibliográficos
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:
Regular Paper
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

Internet

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