{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T04:57:39Z","timestamp":1762145859742,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T00:00:00Z","timestamp":1592697600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,21]]},"DOI":"10.1145\/3409915.3409925","type":"proceedings-article","created":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T16:15:58Z","timestamp":1596125758000},"page":"34-41","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Unified Proof for Finding a Minimal Spanning Tree"],"prefix":"10.1145","author":[{"given":"Ray-Ming","family":"Chen","sequence":"first","affiliation":[{"name":"Baise University, Baise, Guangxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,30]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Sebastien Bubeck and Ulrike von Luxburg. 2009. Nearest Neighbor Clustering: A Baseline Method for Consistent Clustering with Arbitrary Objective Functions.  Sebastien Bubeck and Ulrike von Luxburg. 2009. Nearest Neighbor Clustering: A Baseline Method for Consistent Clustering with Arbitrary Objective Functions."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.3390\/mca23040066"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/7630242"},{"volume-title":"Graph Theory","author":"Diestel Reinhard","key":"e_1_3_2_1_4_1","unstructured":"Reinhard Diestel . 2010. Graph Theory . Springer-Verlag , Heidelberg . Reinhard Diestel. 2010. Graph Theory. Springer-Verlag, Heidelberg."},{"key":"e_1_3_2_1_5_1","volume-title":"Numerische Mathematik","volume":"1","author":"Dijkstra E. W.","year":"1959","unstructured":"E. W. Dijkstra . 1959 . A Note on Two Problems in Connexion with Graph . Numerische Mathematik , Volume 1 Issue 1. E. W. Dijkstra. 1959. A Note on Two Problems in Connexion with Graph. Numerische Mathematik, Volume 1 Issue 1."},{"key":"e_1_3_2_1_6_1","volume-title":"Frane and Maryann Hill","author":"James","year":"1976","unstructured":"James W. Frane and Maryann Hill . 1976 . Factor analysis as a tool for data analysis. Communications in Statistics - Theory and Methods . James W. Frane and Maryann Hill. 1976. Factor analysis as a tool for data analysis. Communications in Statistics - Theory and Methods."},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the American Mathematical Society, Vol, 7, No, 1.","author":"Kruska Joseph B.","year":"1956","unstructured":"Joseph B. Kruska Jr . 1956 . On the shortest spanning subtree of a graph and the traveling salesman problem . Proceedings of the American Mathematical Society, Vol, 7, No, 1. Joseph B. Kruska Jr. 1956. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, Vol, 7, No, 1."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s40745-015-0040-1"}],"event":{"name":"ICoMS 2020: 2020 3rd International Conference on Mathematics and Statistics","sponsor":["Universidade Nova de Lisboa"],"location":"Paris France","acronym":"ICoMS 2020"},"container-title":["Proceedings of the 2020 3rd International Conference on Mathematics and Statistics"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409915.3409925","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409915.3409925","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:07Z","timestamp":1750191427000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409915.3409925"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,21]]},"references-count":9,"alternative-id":["10.1145\/3409915.3409925","10.1145\/3409915"],"URL":"https:\/\/doi.org\/10.1145\/3409915.3409925","relation":{},"subject":[],"published":{"date-parts":[[2020,6,21]]},"assertion":[{"value":"2020-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}