{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:27Z","timestamp":1740107127934,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T00:00:00Z","timestamp":1718064000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T00:00:00Z","timestamp":1718064000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2022-03697","DGECR-2022-00446","RGPIN-2018-04211"],"award-info":[{"award-number":["RGPIN-2022-03697","DGECR-2022-00446","RGPIN-2018-04211"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s00373-024-02808-2","type":"journal-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T02:01:36Z","timestamp":1718071296000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan"],"prefix":"10.1007","volume":"40","author":[{"given":"Ben","family":"Cameron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8865-7733","authenticated-orcid":false,"given":"Aaron","family":"Grubb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe","family":"Sawada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"issue":"5","key":"2808_CR1","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s00373-007-0750-z","volume":"23","author":"O Aichholzer","year":"2007","unstructured":"Aichholzer, O., Aurenhammer, F., Huemer, C., Vogtenhuber, B.: Gray code enumeration of plane straight-line graphs. Graphs and Combinatorics 23(5), 467\u2013479 (2007)","journal-title":"Graphs and Combinatorics"},{"key":"2808_CR2","doi-asserted-by":"crossref","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Applied Mathematics, 65(1):21\u201346, First International Colloquium on Graphs and Optimization (1996)","DOI":"10.1016\/0166-218X(95)00026-N"},{"issue":"4","key":"2808_CR3","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1109\/TCT.1967.1082758","volume":"14","author":"I Berger","year":"1967","unstructured":"Berger, I.: The enumeration of trees without duplication. IEEE Trans. Circ. Theory 14(4), 417\u2013418 (1967)","journal-title":"IEEE Trans. Circ. Theory"},{"issue":"16","key":"2808_CR4","first-page":"781","volume":"2","author":"ZR Bogdanowicz","year":"2008","unstructured":"Bogdanowicz, Z.R.: Formulas for the number of spanning trees in a fan. Appl. Math. Sci. 2(16), 781\u2013786 (2008)","journal-title":"Appl. Math. Sci."},{"key":"2808_CR5","doi-asserted-by":"crossref","unstructured":"Cameron, B., Grubb, A., Sawada, J.: A greedy Gray code listing for the spanning trees of the fan graph. In Proceedings of The 27th International Computing and Combinatorics Conference (COCOON), pages 49\u201360, (2021)","DOI":"10.1007\/978-3-030-89543-3_5"},{"issue":"3","key":"2808_CR6","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s40747-018-0079-7","volume":"5","author":"M Chakraborty","year":"2019","unstructured":"Chakraborty, M., Chowdhury, S., Chakraborty, J., Mehera, R., Pal, R.K.: Algorithms for generating all possible spanning trees of a simple undirected connected graph: an extensive review. Complex Intell. Syst. 5(3), 265\u2013281 (2019)","journal-title":"Complex Intell. Syst."},{"issue":"3","key":"2808_CR7","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1109\/TCT.1968.1082817","volume":"15","author":"J Char","year":"1968","unstructured":"Char, J.: Generation of trees, two-trees, and storage of master forests. IEEE Trans. Circ. Theory 15(3), 228\u2013238 (1968)","journal-title":"IEEE Trans. Circ. Theory"},{"issue":"2","key":"2808_CR8","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1006\/jagm.1996.0014","volume":"20","author":"CJ Colbourn","year":"1996","unstructured":"Colbourn, C.J., Myrvold, W.J., Neufeld, E.: Two algorithms for unranking arborescences. J. Algorithms 20(2), 268\u2013281 (1996)","journal-title":"J. Algorithms"},{"issue":"1","key":"2808_CR9","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/TCT.1966.1082546","volume":"13","author":"R Cummins","year":"1966","unstructured":"Cummins, R.: Hamilton circuits in tree graphs. IEEE Trans. Circuit Theory 13(1), 82\u201390 (1966)","journal-title":"IEEE Trans. Circuit Theory"},{"issue":"13","key":"2808_CR10","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1002\/andp.19023141320","volume":"314","author":"W Feussner","year":"1902","unstructured":"Feussner, W.: Ueber stromverzweigung in netzf\u00f6rmigen leitern. Annalen der Physik 314(13), 1304\u20131329 (1902)","journal-title":"Annalen der Physik"},{"issue":"3","key":"2808_CR11","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1137\/0207024","volume":"7","author":"HN Gabow","year":"1978","unstructured":"Gabow, H.N., Myers, E.W.: Finding all spanning trees of directed and undirected graphs. SIAM J. Comput. 7(3), 280\u2013287 (1978)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"2808_CR12","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0016-0032(61)90036-9","volume":"272","author":"S Hakimi","year":"1961","unstructured":"Hakimi, S.: On trees of a graph and their generation. J. Franklin Inst. 272(5), 347\u2013359 (1961)","journal-title":"J. Franklin Inst."},{"key":"2808_CR13","doi-asserted-by":"crossref","unstructured":"Hartung, E., Hoang, H.P., M\u00fctze, T., Williams, A.: Combinatorial generation via permutation languages. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1214\u20131225. SIAM, (2020)","DOI":"10.1137\/1.9781611975994.74"},{"key":"2808_CR14","unstructured":"Hoang, H.P., M\u00fctze, T.: Combinatorial generation via permutation languages. II. lattice congruences. arXiv preprint arXiv:1911.12078, (2019)"},{"issue":"2","key":"2808_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/0122021","volume":"22","author":"CA Holzmann","year":"1972","unstructured":"Holzmann, C.A., Harary, F.: On the tree graph of a matroid. SIAM J. Appl. Math. 22(2), 187\u2013193 (1972)","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"2808_CR16","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/TCT.1967.1082707","volume":"14","author":"T Kamae","year":"1967","unstructured":"Kamae, T.: The existence of a Hamilton circuit in a tree graph. IEEE Trans. Circ. Theory 14(3), 279\u2013283 (1967)","journal-title":"IEEE Trans. Circ. Theory"},{"issue":"2","key":"2808_CR17","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1137\/S009753979225030X","volume":"24","author":"S Kapoor","year":"1995","unstructured":"Kapoor, S., Ramesh, H.: Algorithms for enumerating all spanning trees of undirected and weighted graphs. SIAM J. Comput. 24(2), 247\u2013265 (1995)","journal-title":"SIAM J. Comput."},{"key":"2808_CR18","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s004530010008","volume":"27","author":"S Kapoor","year":"2000","unstructured":"Kapoor, S., Ramesh, H.: An algorithm for enumerating all spanning trees of a directed graph. Algorithmica 27, 120\u2013130 (2000)","journal-title":"Algorithmica"},{"key":"2808_CR19","doi-asserted-by":"crossref","unstructured":"Katoh, N., Tanigawa, S.: Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees. Discrete Applied Mathematics, 157(17):3569\u20133585, Sixth International Conference on Graphs and Optimization 2007 (2009)","DOI":"10.1016\/j.dam.2009.04.019"},{"issue":"3","key":"2808_CR20","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s00454-009-9164-4","volume":"42","author":"N Katoh","year":"2009","unstructured":"Katoh, N., Tanigawa, S.: Fast enumeration algorithms for non-crossing geometric graphs. Discrete Comput. Geometry 42(3), 443\u2013468 (2009)","journal-title":"Discrete Comput. Geometry"},{"issue":"1","key":"2808_CR21","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/TCT.1968.1082762","volume":"15","author":"G Kishi","year":"1968","unstructured":"Kishi, G., Kajitani, Y.: On Hamilton circuits in tree graphs. IEEE Trans. Circ. Theory 15(1), 42\u201350 (1968)","journal-title":"IEEE Trans. Circ. Theory"},{"key":"2808_CR22","unstructured":"Knuth, D.E.: The Art of Computer Programming: Combinatorial Algorithms, Part 1. Addison-Wesley Professional, 1st edition, (2011)"},{"key":"2808_CR23","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/PL00009171","volume":"18","author":"T Matsui","year":"1997","unstructured":"Matsui, T.: A flexible algorithm for generating all the spanning trees in undirected graphs. Algorithmica 18, 530\u2013543 (1997)","journal-title":"Algorithmica"},{"issue":"2","key":"2808_CR24","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TCT.1965.1082432","volume":"12","author":"W Mayeda","year":"1965","unstructured":"Mayeda, W., Seshu, S.: Generation of trees without duplications. IEEE Trans. Circ. Theory 12(2), 181\u2013185 (1965)","journal-title":"IEEE Trans. Circ. Theory"},{"key":"2808_CR25","doi-asserted-by":"crossref","unstructured":"Merino, A., M\u00fctze, T.: Traversing combinatorial 0\/1-polytopes via optimization. In 64th IEEE Symposium on the Foundations of Computer Science (FOCS 2023)","DOI":"10.1109\/FOCS57990.2023.00076"},{"key":"2808_CR26","unstructured":"Merino, A., M\u00fctze, T.: Efficient generation of rectangulations via permutation languages. In 37th International Symposium on Computational Geometry (SoCG 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, (2021)"},{"key":"2808_CR27","unstructured":"Merino, A., M\u00fctze, T., Williams, A.: All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges. In P. Fraigniaud and Y. Uno, editors, 11th International Conference on Fun with Algorithms (FUN 2022), volume 226, pages 22:1\u201322:28, (2022)"},{"issue":"1","key":"2808_CR28","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/TCT.1965.1082385","volume":"12","author":"G Minty","year":"1965","unstructured":"Minty, G.: A simple algorithm for listing all the trees of a graph. IEEE Trans. Circ. Theory 12(1), 120\u2013120 (1965)","journal-title":"IEEE Trans. Circ. Theory"},{"issue":"3","key":"2808_CR29","first-page":"331","volume":"38","author":"A Shioura","year":"1995","unstructured":"Shioura, A., Tamura, A.: Efficiently scanning all spanning trees of an undirected graph. J. Oper. Res. Soc. Jpn. 38(3), 331\u2013344 (1995)","journal-title":"J. Oper. Res. Soc. Jpn."},{"issue":"3","key":"2808_CR30","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1137\/S0097539794270881","volume":"26","author":"A Shioura","year":"1997","unstructured":"Shioura, A., Tamura, A., Uno, T.: An optimal algorithm for scanning all spanning trees of undirected graphs. SIAM J. Comput. 26(3), 678\u2013692 (1997)","journal-title":"SIAM J. Comput."},{"key":"2808_CR31","unstructured":"Smith, M.J.: Generating spanning trees. Master\u2019s thesis, University of Victoria, (1997)"},{"key":"2808_CR32","doi-asserted-by":"crossref","unstructured":"Williams, A.: The greedy Gray code algorithm. In Workshop on Algorithms and Data Structures, pages 525\u2013536. Springer, (2013)","DOI":"10.1007\/978-3-642-40104-6_46"},{"key":"2808_CR33","doi-asserted-by":"crossref","unstructured":"Williams, V.V., Xu, Y., Xu, Z., Zhou, R.: New Bounds for Matrix Multiplication: from Alpha to Omega. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 3792\u20133835","DOI":"10.1137\/1.9781611977912.134"},{"key":"2808_CR34","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/BF01939361","volume":"26","author":"P Winter","year":"1985","unstructured":"Winter, P.: An algorithm for the enumeration of spanning trees. BIT Numer. Math. 26, 44\u201362 (1985)","journal-title":"BIT Numer. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02808-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02808-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02808-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T19:04:26Z","timestamp":1723230266000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02808-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,11]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["2808"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02808-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,6,11]]},"assertion":[{"value":"18 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"78"}}