Liu, Y., Zhang, M., Liu, J., & Zhou, Y. (2026). Graph downsizing: A fast heuristic for querying closely connected subgraphs. Journal of Heuristics, 32(1), 1. https://doi.org/10.1007/s10732-026-09585-6
Chicago Style (17th ed.) CitationLiu, Yiping, Mengxiao Zhang, Jiamou Liu, and Yi Zhou. "Graph Downsizing: A Fast Heuristic for Querying Closely Connected Subgraphs." Journal of Heuristics 32, no. 1 (2026): 1. https://doi.org/10.1007/s10732-026-09585-6.
MLA (9th ed.) CitationLiu, Yiping, et al. "Graph Downsizing: A Fast Heuristic for Querying Closely Connected Subgraphs." Journal of Heuristics, vol. 32, no. 1, 2026, p. 1, https://doi.org/10.1007/s10732-026-09585-6.
Warning: These citations may not always be 100% accurate.