{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:06:43Z","timestamp":1760148403780,"version":"build-2065373602"},"reference-count":37,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T00:00:00Z","timestamp":1682553600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The Stirling numbers for graphs provide a combinatorial interpretation of the number of cycle covers in a given graph. The problem of generating all cycle covers or enumerating these quantities on general graphs is computationally intractable, but recent work has shown that there exist infinite families of sparse or structured graphs for which it is possible to derive efficient enumerative formulas. In this paper, we consider the case of trees and forests of a fixed size, proposing an efficient algorithm based on matrix algebra to approximate the distribution of Stirling numbers. We also present a model application of machine learning to enumeration problems in this setting, demonstrating that standard regression techniques can be applied to this type of combinatorial structure.<\/jats:p>","DOI":"10.3390\/a16050223","type":"journal-article","created":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T01:28:28Z","timestamp":1682558908000},"page":"223","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Stirling Numbers of Uniform Trees and Related Computational Experiments"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4410-5819","authenticated-orcid":false,"given":"Amir","family":"Barghi","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, Saint Michael\u2019s College, Colchester, VT 05439, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2032-3168","authenticated-orcid":false,"given":"Daryl","family":"DeFord","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, Washington State University, Pullman, WA 99163, USA"}]}],"member":"1968","published-online":{"date-parts":[[2023,4,27]]},"reference":[{"key":"ref_1","unstructured":"Barghi, A., and DeFord, D.R. (Discret. Appl. Math., 2022). Ranking Trees Based on Global Centrality Measures, Discret. Appl. Math., Submitted."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01010403","article-title":"Two-dimensional monomer-dimer systems are computationally intractable","volume":"48","author":"Jerrum","year":"1987","journal-title":"J. Stat. Phys."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theor. Comput. Sci."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dam.2020.08.019","article-title":"A tree distinguishing polynomial","volume":"288","author":"Liu","year":"2021","journal-title":"Discret. Appl. Math."},{"key":"ref_5","first-page":"253","article-title":"Stirling numbers of the first kind for graphs","volume":"70","author":"Barghi","year":"2018","journal-title":"Australas. J. Comb."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"787","DOI":"10.2140\/involve.2014.7.787","article-title":"Seating rearrangements on arbitrary graphs","volume":"7","author":"DeFord","year":"2014","journal-title":"Involv. A J. Math."},{"key":"ref_7","unstructured":"Honsberger, R. (1997). In P\u00f3lya\u2019s Footsteps; Vol. 19, The Dolciani Mathematical Expositions, Mathematical Association of America. pp. xii+315."},{"key":"ref_8","first-page":"59","article-title":"Variations on a 5 \u00d7 5 seating rearrangement problem","volume":"Fall\u2013Winter","author":"Kennedy","year":"1993","journal-title":"Math. Coll."},{"key":"ref_9","first-page":"63","article-title":"On a seating rearrangement problem","volume":"52","author":"Otake","year":"1996","journal-title":"Math. Inform. Q."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","article-title":"Centrality in social networks conceptual clarification","volume":"1","author":"Freeman","year":"1978","journal-title":"Soc. Netw."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","article-title":"A set of measures of centrality based on betweenness","volume":"40","author":"Freeman","year":"1977","journal-title":"Sociometry"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.socnet.2004.11.008","article-title":"Centrality and network flow","volume":"27","author":"Borgatti","year":"2005","journal-title":"Soc. Netw."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Wilson, D.B. (1996, January 22\u201324). Generating Random Spanning Trees More Quickly Than the Cover Time. Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, STOC \u201996, Philadelphia, PA, USA.","DOI":"10.1145\/237814.237880"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1145\/1008731.1008738","article-title":"A Polynomial-Time Approximation Algorithm for the Permanent of a Matrix with Nonnegative Entries","volume":"51","author":"Jerrum","year":"2004","journal-title":"J. ACM"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","article-title":"Random generation of combinatorial structures from a uniform distribution","volume":"43","author":"Jerrum","year":"1986","journal-title":"Theor. Comput. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Jerrum, M. (2003). Counting, Sampling and Integrating: Algorithms and Complexity, Birkhauser.","DOI":"10.1007\/978-3-0348-8005-3"},{"key":"ref_17","unstructured":"Harary, F. (1967). Graph Theory and Theoretical Physics, Academic Press."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"46","DOI":"10.37236\/1384","article-title":"An exploration of the permanent-determinant method","volume":"5","author":"Kuperberg","year":"1998","journal-title":"Electron. J. Combin."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Ellis-Monaghan, J., and Moffatt, I. (2022). Handbook of the Tutte Polynomial and Related Topics, Chapman & Hall.","DOI":"10.1201\/9780429161612"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Dong, F.M., and Teo, K.L. (2005). Chromatic Polynomials and Chromaticity of Graphs, World Scientific.","DOI":"10.1142\/5814"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Yang, X., Wang, Z., Zhang, H., Ma, N., Yang, N., Liu, H., Zhang, H., and Yang, L. (2022). A Review: Machine Learning for Combinatorial Optimization Problems in Energy Areas. Algorithms, 15.","DOI":"10.3390\/a15060205"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"105400","DOI":"10.1016\/j.cor.2021.105400","article-title":"Reinforcement learning for combinatorial optimization: A survey","volume":"134","author":"Mazyavkina","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","article-title":"Machine learning for combinatorial optimization: A methodological tour d\u2019horizon","volume":"290","author":"Bengio","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.ejor.2021.04.032","article-title":"Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: A state-of-the-art","volume":"296","author":"Mohammadi","year":"2022","journal-title":"Eur. J. Oper. Res."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Castaneda, J., Neroni, M., Ammouriova, M., Panadero, J., and Juan, A.A. (2022). Biased-Randomized Discrete-Event Heuristics for Dynamic Optimization with Time Dependencies and Synchronization. Algorithms, 15.","DOI":"10.3390\/a15080289"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1007\/s00291-021-00642-z","article-title":"Machine learning and combinatorial optimization, editorial","volume":"43","author":"Caro","year":"2021","journal-title":"OR Spectr."},{"key":"ref_27","unstructured":"Barrett, T.D., Parsonson, C.W.F., and Laterre, A. (2022). Learning to Solve Combinatorial Graph Partitioning Problems via Efficient Exploration. arXiv."},{"key":"ref_28","unstructured":"Wagner, A.Z. (2021). Constructions in combinatorics via neural networks. arXiv."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","article-title":"A Comprehensive Survey on Graph Neural Networks","volume":"32","author":"Wu","year":"2021","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.aiopen.2021.01.001","article-title":"Graph neural networks: A review of methods and applications","volume":"1","author":"Zhou","year":"2020","journal-title":"AI Open"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"13207","DOI":"10.1073\/pnas.1917151117","article-title":"Gaussian determinantal processes: A new model for directionality in data","volume":"117","author":"Ghosh","year":"2020","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_32","unstructured":"Borodin, A. (2009). Determinantal point processes. arXiv."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Kulesza, A., and Taskar, B. (2012). Determinantal Point Processes for Machine Learning, Now Publishers Inc.","DOI":"10.1561\/9781601986290"},{"key":"ref_34","unstructured":"Dughmi, S. (2011). Submodular Functions: Extensions, Distributions, and Algorithms. A Survey. arXiv."},{"key":"ref_35","unstructured":"Bilmes, J. (2022). Submodularity In Machine Learning and Artificial Intelligence. arXiv."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1561\/2200000039","article-title":"Learning with Submodular Functions: A Convex Optimization Perspective","volume":"6","author":"Bach","year":"2013","journal-title":"Found. Trends Mach. Learn."},{"key":"ref_37","first-page":"2825","article-title":"Scikit-learn: Machine Learning in Python","volume":"12","author":"Pedregosa","year":"2011","journal-title":"J. Mach. Learn. Res."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/5\/223\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:24:07Z","timestamp":1760124247000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/5\/223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,27]]},"references-count":37,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2023,5]]}},"alternative-id":["a16050223"],"URL":"https:\/\/doi.org\/10.3390\/a16050223","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2023,4,27]]}}}