Enumeration of Billions of Maximal Bicliques in Bipartite Graphs without Using GPUs

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 degr...

Full description

Bibliographic Details

Published in:	SC24: International Conference for High Performance Computing, Networking, Storage and Analysis pp. 1 - 15
Main Authors:	Pan, Zhe, He, Shuibing, Li, Xu, Zhang, Xuechen, Yin, Yanlong, Wang, Rui, Shou, Lidan, Song, Mingli, Sun, Xian-He, Chen, Gang
Format:	Conference Proceeding
Language:	English
Published:	IEEE 17.11.2024
Subjects:	Bipartite graph bitmap Computational efficiency Graphics processing units Heuristic algorithms High performance computing maximal biclique enumeration Memory management
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!