The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation.

MLA

Enright, Jessica, et al. “The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation.” Algorithmica, vol. 86, no. 10, Oct. 2024, pp. 3186–230. EBSCOhost, https://doi.org/10.1007/s00453-024-01256-x.

APA

Enright, J., Lee, D., Meeks, K., Pettersson, W., & Sylvester, J. (2024). The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation. Algorithmica, 86(10), 3186–3230. https://doi.org/10.1007/s00453-024-01256-x

Chicago

Enright, Jessica, Duncan Lee, Kitty Meeks, William Pettersson, and John Sylvester. 2024. “The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation.” Algorithmica 86 (10): 3186–3230. doi:10.1007/s00453-024-01256-x.