Work

Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy

Year: 2026

Type: article

Source: Proceedings of the ACM on Management of Data

DOI: 10.1145/3802086

Authors: Kaixin Wang, Kaiqiang Yu, Cheng Long

Institutions: Beijing University of Technology, Nanjing University, Nanyang Technological University

Language: English

Topic: Graph Theory and Algorithms

Subfield: Computer Vision and Pattern Recognition

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

Funders: Ministry of Education - Singapore, National Natural Science Foundation of China

Awards: G3390131786, G5522805745, G7616380200

OpenAlex ID: W7161593484

FWCI:

Cites: 24

Cited by:

Related to: