[41] S. Hojsgaard and S. L. Lauritzen, “Graphical Gaussian models with edge and vertex symmetries,” Journal of the Royal Statistical Society: Series B (Statistical Methodology), vol. 70, no. 5, pp. 1005–1027, 2008.
[42] M. L. Stein, "Space-time covariance functions," Journal of the American Statistical Association, vol. 100, no. 469, pp. 310-321, 2005.
[43] C. Li and H. Li, "Network-constrained regularization and variable selection for analysis of genomic data," Bioinformatics, vol. 24, no. 9, pp. 1175-1182, 2008.
[44] R. E. Tarjan, “A note on finding the bridges of a graph,” Information Processing Letters, vol. 2, no. 6, pp. 160–161, 1974.
[45] J. Westbrook and R. E. Tarjan, "Maintaining bridge-connected and biconnected components on-line," Algorithmica, vol. 7, no. 1, pp. 433-464, 1992.
[46] L. Chang, J. X. Yu, L. Qin, X. Lin, C. Liu, and W. Liang, "Efficiently computing k-edge connected components via graph decomposition," in Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, 2013, pp. 205-216.
[47] R. Zhou, C. Liu, J. X. Yu, W. Liang, B. Chen, and J. Li, “Finding maximal k-edge-connected subgraphs from a large graph,” in Proceedings of the 15th International Conference on Extending Database Technology, 2012, pp. 480–491.
[48] Y. Fang, X. Huang, L. Qin, Y. Zhang, W. Zhang, R. Cheng, and X. Lin, "A survey of community search over big graphs," The VLDB Journal, vol. 29, no. 1, pp. 353-392, 2020.
[49] R. Agrawal, S. Rajagopalan, R. Srikant, and Y. Xu, "Mining newsgroups using networks arising from social behavior," in Proceedings of the 12th International Conference on World Wide Web, 2003, pp. 529-535.
[50] L. Lan and A. Zocca, “Refining bridge-block decompositions through two-stage and recursive tree partitioning,” arXiv preprint arXiv:2110.06998, 2021.
[51] D. Kim, S. Sra, and I. S. Dhillon, "Tackling box-constrained optimization via a new projected quasi-Newton approach," SIAM Journal on Scientific Computing, vol. 32, no. 6, pp. 3548-3563, 2010.
[52] A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, no. 5439, pp. 509–512, 1999.
[53] R. Albert and A.-L. Barabási, "Statistical mechanics of complex networks," *Reviews of Modern Physics*, vol. 74, no. 1, p. 47, 2002.
[54] P. W. Holland, K. B. Laskey, and S. Leinhardt, "Stochastic blockmodels: First steps," Social Networks, vol. 5, no. 2, pp. 109-137, 1983.
[55] S. Fortunato, "Community detection in graphs," Physics Reports, vol. 486, no. 3-5, pp. 75-174, 2010.
[56] H. A. Dau, A. Bagnall, K. Kamgar, C.-C. M. Yeh, Y. Zhu, S. Gharghabi, C. A. Ratanamahatana, and E. Keogh, "The UCR time series archive," IEEE/CAA Journal of Automatica Sinica, vol. 6, no. 6, pp. 1293-1305, 2019.
[57] C. W. Tan, G. I. Webb, and F. Petitjean, "Indexing and classifying gigabytes of time series under time warping," in SIAM International Conference on Data Mining, 2017, pp. 1-10.
[58] M. E. Newman, "Modularity and community structure in networks," Proceedings of the National Academy of Sciences, vol. 103, no. 23, pp. 8577-8582, 2006.
[59] F. Nie, X. Wang, M. Jordan, and H. Huang, "The constrained Laplacian rank algorithm for graph-based clustering," in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 30, no. 1, 2016.