(p,q)-biclique counting and enumeration for large sparse bipartite graphs.

Yang J, Peng Y, Ouyang D, Zhang W, Lin X, Zhao X

Open source

DOI
10.1007/s00778-023-00786-0
Published
2023 Mar 13
Container
The VLDB journal : very large data bases : a publication of the VLDB Endowment
Publisher
Not recorded
Open access
yes

Credibility signals

limited evidence Score 45/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1007/s00778-023-00786-0,
  title = {(p,q)-biclique counting and enumeration for large sparse bipartite graphs.},
  author = {Yang J and Peng Y and Ouyang D and Zhang W and Lin X and Zhao X},
  year = {2023},
  journal = {The VLDB journal : very large data bases : a publication of the VLDB Endowment},
  doi = {10.1007/s00778-023-00786-0},
  url = {https://doi.org/10.1007/s00778-023-00786-0}
}

RIS

TY  - JOUR
TI  - (p,q)-biclique counting and enumeration for large sparse bipartite graphs.
AU  - Yang J
AU  - Peng Y
AU  - Ouyang D
AU  - Zhang W
AU  - Lin X
AU  - Zhao X
PY  - 2023
JO  - The VLDB journal : very large data bases : a publication of the VLDB Endowment
DO  - 10.1007/s00778-023-00786-0
UR  - https://doi.org/10.1007/s00778-023-00786-0
ER  - 

APA

J, Y., Y, P., D, O., W, Z., X, L., & X, Z. (2023). (p,q)-biclique counting and enumeration for large sparse bipartite graphs.. The VLDB journal : very large data bases : a publication of the VLDB Endowment. https://doi.org/10.1007/s00778-023-00786-0

Source records