Personalized maximum $(\alpha ,\beta ,\eta )$-biclique search On uncertain bipartite graph
Authors:
- 22 September 2026
- journal article
- research article
- Published by Springer Nature in Distributed and Parallel Databases
- Vol. 44 (1) , 9
Abstract
No abstract availableKeywords
This publication has 44 references indexed in Scilit:
- Butterfly counting and bitruss decomposition on uncertain bipartite graphsThe VLDB Journal, 2023
- Efficient enumeration of maximal induced bicliquesDiscrete Applied Mathematics, 2021
- Efficient ($\alpha $, $\beta $)-core computation in bipartite graphsThe VLDB Journal, 2020
- Bipartite graphs in systems biology and medicine: a survey of methods and applicationsGigaScience, 2018
- Human symptoms–disease networkNature Communications, 2014
- Enumerating maximal bicliques in bipartite graphs with favorable degree sequencesInformation Processing Letters, 2014
- Efficient Mining of Large Maximal Bicliques2006
- A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns2005
- Discovering statistically significant biclusters in gene expression dataBioinformatics, 2002
- Trawling the Web for emerging cyber-communitiesComputer Networks, 1999