{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:30:12Z","timestamp":1743035412594,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031185298"},{"type":"electronic","value":"9783031185304"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-18530-4_15","type":"book-chapter","created":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T23:02:30Z","timestamp":1668985350000},"page":"201-211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generating Spanning-Tree Sequences of\u00a0a\u00a0Fan Graph in\u00a0Lexicographic Order and\u00a0Ranking\/Unranking Algorithms"],"prefix":"10.1007","author":[{"given":"Ro-Yu","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng-Chia","family":"Tseng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling-Ju","family":"Hung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,21]]},"reference":[{"issue":"16","key":"15_CR1","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":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-030-89543-3_5","volume-title":"Computing and Combinatorics","author":"B Cameron","year":"2021","unstructured":"Cameron, B., Grubb, A., Sawada, J.: A pivot gray code listing for the spanning trees of the fan graph. In: Chen, C.-Y., Hon, W.-K., Hung, L.-J., Lee, C.-W. (eds.) COCOON 2021. LNCS, vol. 13025, pp. 49\u201360. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89543-3_5"},{"issue":"3","key":"15_CR3","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). https:\/\/doi.org\/10.1007\/s40747-018-0079-7","journal-title":"Complex Intell. Syst."},{"issue":"4","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1007\/s11590-020-01613-z","volume":"15","author":"Y-H Chang","year":"2021","unstructured":"Chang, Y.-H., Wu, R.-Y., Lin, C.-K., Chang, J.-M.: A loopless algorithm for generating $$(k, m)$$-ary trees in gray code order. Optim. Lett. 15(4), 1133\u20131154 (2021). https:\/\/doi.org\/10.1007\/s11590-020-01613-z","journal-title":"Optim. Lett."},{"issue":"2","key":"15_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":"2","key":"15_CR6","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"},{"key":"15_CR7","series-title":"Lecture Notes on Data Engineering and Communications Technologies","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-981-33-4968-1_14","volume-title":"Proceedings of International Conference on Computational Intelligence, Data Science and Cloud Computing","author":"S Datta","year":"2021","unstructured":"Datta, S., Chakraborty, S., Chakraborty, M., Pal, R.K.: Algorithm to generate all spanning tree structures of a complete graph. In: Balas, V.E., Hassanien, A.E., Chakrabarti, S., Mandal, L. (eds.) Proceedings of International Conference on Computational Intelligence, Data Science and Cloud Computing. LNDECT, vol. 62, pp. 169\u2013184. Springer, Singapore (2021). https:\/\/doi.org\/10.1007\/978-981-33-4968-1_14"},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1142\/S0129054104002650","volume":"15","author":"\u00d6 E\u01e7ecio\u01e7lu","year":"2004","unstructured":"E\u01e7ecio\u01e7lu, \u00d6., Remmel, J.B., Williamson, S.G.: A class of graphs which has efficient ranking and unranking algorithms for spanning trees and forests. Int. J. Found. Comput. Sci. 15(4), 619\u2013648 (2004)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"15_CR9","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":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/j.tcs.2007.07.041","volume":"387","author":"A Golynski","year":"2007","unstructured":"Golynski, A.: Optimal lower bounds for rank and select indexes. Theor. Comput. Sci. 387(3), 348\u2013359 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"15_CR11","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":"2","key":"15_CR12","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(2), 120\u2013130 (2000). https:\/\/doi.org\/10.1007\/s004530010008","journal-title":"Algorithmica"},{"issue":"3","key":"15_CR13","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.tcs.2007.07.013","volume":"387","author":"V M\u00e4kinen","year":"2007","unstructured":"M\u00e4kinen, V., Navarro, G.: Rank and select revisited and extended. Theor. Comput. Sci. 387(3), 332\u2013347 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"15_CR14","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(4), 530\u2013543 (1997). https:\/\/doi.org\/10.1007\/PL00009171","journal-title":"Algorithmica"},{"issue":"1","key":"15_CR15","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/TCT.1965.1082385","volume":"12","author":"GJ Minty","year":"1965","unstructured":"Minty, G.J.: 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":"1","key":"15_CR16","doi-asserted-by":"publisher","first-page":"1850005","DOI":"10.1142\/S1793830918500052","volume":"10","author":"KKM Reddy","year":"2018","unstructured":"Reddy, K.K.M., Renjith, P., Sadagopan, N.: Listing all spanning trees in Halin graphs - sequential and parallel view. Discrete Math. Algorithms Appl. 10(1), 1850005 (2018)","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"1","key":"15_CR17","doi-asserted-by":"publisher","first-page":"R34","DOI":"10.37236\/1650","volume":"9","author":"JB Remmel","year":"2002","unstructured":"Remmel, J.B., Williamson, S.G.: Spanning trees and function classes. Electron. J. Comb. 9(1), R34 (2002)","journal-title":"Electron. J. Comb."},{"key":"15_CR18","unstructured":"Remmel, J.B., Williamson, S.G.: Ranking and unranking trees with a given number or a given set of leaves. arXiv:1009.2060v1"},{"issue":"3","key":"15_CR19","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."},{"issue":"5\u20136","key":"15_CR20","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1016\/j.mcm.2010.12.019","volume":"53","author":"R-Y Wu","year":"2011","unstructured":"Wu, R.-Y., Chang, J.-M., Chang, C.-H.: Ranking and unranking of non-regular trees with a prescribed branching sequence. Math. Comput. Model. 53(5\u20136), 1331\u20131335 (2011)","journal-title":"Math. Comput. Model."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-18530-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T23:03:36Z","timestamp":1668985416000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18530-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031185298","9783031185304"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18530-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isco2022.sciencesconf.org\/","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":"50","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":"24","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":"48% - 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":"4-5","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":"4-5","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)"}}]}}