Efficient Maximum $$(\alpha ,\beta )$$-Quasi Biclique Computation on Bipartite Graphs
Fields of Study & Subjects
Complexity and Algorithms in Graphs
Graph Theory and Algorithms
Complex Network Analysis Techniques
Publication details
- Journal / source
- Lecture notes in computer science
- Pages
- 103–119
- Publication date
- 1 January 2026
- Language
- EN