APA (7th ed.) Citation

Wang, K., Yu, K., & Long, C. (2026). Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy.

Chicago Style (17th ed.) Citation

Wang, Kaixin, Kaiqiang Yu, and Cheng Long. Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy. 2026.

MLA (9th ed.) Citation

Wang, Kaixin, et al. Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy. 2026.