{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:23:25Z","timestamp":1742912605203,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030895426"},{"type":"electronic","value":"9783030895433"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89543-3_5","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:03:25Z","timestamp":1634781805000},"page":"49-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph"],"prefix":"10.1007","author":[{"given":"Ben","family":"Cameron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"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":[[2021,10,20]]},"reference":[{"issue":"4","key":"5_CR1","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. Circuit Theory 14(4), 417\u2013418 (1967). https:\/\/doi.org\/10.1109\/TCT.1967.1082758","journal-title":"IEEE Trans. Circuit Theory"},{"issue":"16","key":"5_CR2","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."},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s40747-018-0079-7","volume":"5","author":"M Chakraborty","year":"2018","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 (2018). https:\/\/doi.org\/10.1007\/s40747-018-0079-7","journal-title":"Complex Intell. Syst."},{"issue":"3","key":"5_CR4","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. Circuit Theory 15(3), 228\u2013238 (1968)","journal-title":"IEEE Trans. Circuit Theory"},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0196-6774(89)90016-3","volume":"10","author":"CJ Colbourn","year":"1989","unstructured":"Colbourn, C.J., Day, R.P., Nel, L.D.: Unranking and ranking spanning trees of a graph. J. Algorithms 10(2), 271\u2013286 (1989)","journal-title":"J. Algorithms"},{"issue":"1","key":"5_CR6","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). https:\/\/doi.org\/10.1109\/TCT.1966.1082546","journal-title":"IEEE Trans. Circuit Theory"},{"issue":"13","key":"5_CR7","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. Ann. Phys. 314(13), 1304\u20131329 (1902)","journal-title":"Ann. Phys."},{"issue":"3","key":"5_CR8","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":"5_CR9","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":"5_CR10","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, pp. 1214\u20131225. SIAM (2020)","DOI":"10.1137\/1.9781611975994.74"},{"key":"5_CR11","unstructured":"Hoang, H.P., M\u00fctze, T.: Combinatorial generation via permutation languages. II. Lattice congruences. arXiv preprint arXiv:1911.12078 (2019)"},{"issue":"2","key":"5_CR12","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). https:\/\/doi.org\/10.1137\/0122021","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"5_CR13","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. Circuit Theory 14(3), 279\u2013283 (1967)","journal-title":"IEEE Trans. Circuit Theory"},{"issue":"2","key":"5_CR14","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."},{"issue":"1","key":"5_CR15","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. Circuit Theory 15(1), 42\u201350 (1968). https:\/\/doi.org\/10.1109\/TCT.1968.1082762","journal-title":"IEEE Trans. Circuit Theory"},{"key":"5_CR16","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":"5_CR17","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. Circuit Theory 12(2), 181\u2013185 (1965)","journal-title":"IEEE Trans. Circuit Theory"},{"key":"5_CR18","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)"},{"issue":"1","key":"5_CR19","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. Circuit Theory 12(1), 120 (1965)","journal-title":"IEEE Trans. Circuit Theory"},{"issue":"3","key":"5_CR20","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":"5_CR21","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":"5_CR22","unstructured":"Smith, M.J.: Generating spanning trees. Master\u2019s thesis, University of Victoria (1997)"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-642-40104-6_46","volume-title":"Algorithms and Data Structures","author":"A Williams","year":"2013","unstructured":"Williams, A.: The greedy gray code algorithm. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 525\u2013536. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40104-6_46"},{"key":"5_CR24","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":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89543-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:05:20Z","timestamp":1634781920000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89543-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030895426","9783030895433"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89543-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"131","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}