@inproceedings{10.1109/SC41406.2024.00106,
author = {Pan, Zhe and He, Shuibing and Li, Xu and Zhang, Xuechen and Yin, Yanlong and Wang, Rui and Shou, Lidan and Song, Mingli and Sun, Xian-He and Chen, Gang},
title = {Enumeration of Billions of Maximal Bicliques in Bipartite Graphs without Using GPUs},
year = {2024},
isbn = {9798350352917},
publisher = {IEEE Press},
url = {https://doi.org/10.1109/SC41406.2024.00106},
doi = {10.1109/SC41406.2024.00106},
abstract = {Maximal biclique enumeration (MBE) is crucial in bipartite graph analysis. Recent studies rely on extensive set intersections on static bipartite graphs to solve the MBE problem. However, the computational subgraphs dynamically change during enumeration, leading to redundant memory accesses and degraded set intersection performance. To overcome this limitation, we propose an AdaMBE algorithm. First, we redesign its core operations using local neighborhood information derived from computational subgraphs to minimize redundant memory accesses. Second, we dynamically create computational subgraphs using bitmaps leveraging its fast bitwise operations to accelerate set intersections. Finally, we integrate them in AdaMBE. Our experimental results show that AdaMBE is 1.6\texttimes{}-49.7\texttimes{} faster than its closest CPU-based competitor and successfully enumerates all 19 billion maximal bicliques on the TVTropes dataset, a large task beyond the capabilities of existing algorithms. Notably, on certain datasets, our parallel version, ParAdaMBE, on CPUs even outperforms GMBE on GPUs by up to 5.07\texttimes{}.},
booktitle = {Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis},
articleno = {100},
numpages = {15},
keywords = {Bipartite graph, bitmap, maximal biclique enumeration},
location = {Atlanta, GA, USA},
series = {SC '24}
}