APA (7th ed.) Citation

Li, L. (2026). Split-and-Reduce: A New Exact Algorithm with Tight Multi-Order Intersection Bounds for the Quasi-Clique Enumeration Problem. Mathematics (2227-7390), 14(8), 1298. https://doi.org/10.3390/math14081298

Chicago Style (17th ed.) Citation

Li, Liang. "Split-and-Reduce: A New Exact Algorithm with Tight Multi-Order Intersection Bounds for the Quasi-Clique Enumeration Problem." Mathematics (2227-7390) 14, no. 8 (2026): 1298. https://doi.org/10.3390/math14081298.

MLA (9th ed.) Citation

Li, Liang. "Split-and-Reduce: A New Exact Algorithm with Tight Multi-Order Intersection Bounds for the Quasi-Clique Enumeration Problem." Mathematics (2227-7390), vol. 14, no. 8, 2026, p. 1298, https://doi.org/10.3390/math14081298.