{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T12:36:14Z","timestamp":1765370174752,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031304477"},{"type":"electronic","value":"9783031304484"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30448-4_26","type":"book-chapter","created":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T20:29:36Z","timestamp":1682368176000},"page":"368-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficiently Enumerating All Spanning Trees of\u00a0a\u00a0Plane 3-Tree"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2450-3377","authenticated-orcid":false,"given":"Muhammad Nur","family":"Yanhaona","sequence":"first","affiliation":[]},{"given":"Asswad Sarker","family":"Nomaan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0112-0242","authenticated-orcid":false,"given":"Md. Saidur","family":"Rahman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,25]]},"reference":[{"issue":"1","key":"26_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(92)90648-Y","volume":"100","author":"R Brooks","year":"1992","unstructured":"Brooks, R., Smith, C., Stone, A., Tutte, W.: Determinants and current flows in electric networks. Discret. Math. 100(1), 291\u2013301 (1992). https:\/\/doi.org\/10.1016\/0012-365X(92)90648-Y","journal-title":"Discret. Math."},{"issue":"3","key":"26_CR2","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). https:\/\/doi.org\/10.1109\/TCT.1968.1082817","journal-title":"IEEE Trans. Circ. Theory"},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1109\/TCT.1965.1082396","volume":"12","author":"WK Chen","year":"1965","unstructured":"Chen, W.K.: Topological analysis for active networks. IEEE Trans. Circ. Theory 12(1), 85\u201391 (1965). https:\/\/doi.org\/10.1109\/TCT.1965.1082396","journal-title":"IEEE Trans. Circ. Theory"},{"key":"26_CR4","series-title":"Prentice Hall Series in Automatic Computation","volume-title":"Graph Theory with Applications to Engineering and Computer Science","author":"N Deo","year":"1974","unstructured":"Deo, N.: Graph Theory with Applications to Engineering and Computer Science. Prentice Hall Series in Automatic Computation, Prentice-Hall Inc., USA (1974)"},{"issue":"3","key":"26_CR5","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). https:\/\/doi.org\/10.1137\/0207024","journal-title":"SIAM J. Comput."},{"issue":"2","key":"26_CR6","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1109\/TCT.1964.1082276","volume":"11","author":"S Hakimi","year":"1964","unstructured":"Hakimi, S., Green, D.: Generation and realization of trees and k-trees. IEEE Trans. Circ. Theory 11(2), 247\u2013255 (1964). https:\/\/doi.org\/10.1109\/TCT.1964.1082276","journal-title":"IEEE Trans. Circ. Theory"},{"issue":"5","key":"26_CR7","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). https:\/\/doi.org\/10.1016\/0016-0032(61)90036-9","journal-title":"J. Franklin Inst."},{"issue":"2","key":"26_CR8","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). https:\/\/doi.org\/10.1137\/S009753979225030X","journal-title":"SIAM J. Comput."},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Matsui, T.: An algorithm for finding all the spanning trees in undirected graphs (1998)","DOI":"10.1007\/PL00009171"},{"issue":"2","key":"26_CR10","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). https:\/\/doi.org\/10.1109\/TCT.1965.1082432","journal-title":"IEEE Trans. Circ. Theory"},{"issue":"5 &6","key":"26_CR11","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/BF01758778","volume":"7","author":"H Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7(5 &6), 583\u2013596 (1992). https:\/\/doi.org\/10.1007\/BF01758778","journal-title":"Algorithmica"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-18469-7_29","volume-title":"Graph Drawing","author":"RI Nishat","year":"2011","unstructured":"Nishat, R.I., Mondal, D., Rahman, M.S.: Point-set embeddings of plane 3-trees. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 317\u2013328. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18469-7_29"},{"key":"26_CR13","doi-asserted-by":"publisher","unstructured":"Onete, C.E., Onete, M.C.C.: Enumerating all the spanning trees in an un-oriented graph - a novel approach. In: 2010 XIth International Workshop on Symbolic and Numerical Methods, Modeling and Applications to Circuit Design (SM2ACD), pp. 1\u20135 (2010). https:\/\/doi.org\/10.1109\/SM2ACD.2010.5672365","DOI":"10.1109\/SM2ACD.2010.5672365"},{"issue":"3","key":"26_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1080\/03772063.1981.11452333","volume":"27","author":"A Rakshit","year":"1981","unstructured":"Rakshit, A., Sarma, S.S., Sen, R.K., Choudhury, A.: An efficient tree-generation algorithm. IETE J. Res. 27(3), 105\u2013109 (1981). https:\/\/doi.org\/10.1080\/03772063.1981.11452333","journal-title":"IETE J. Res."},{"issue":"3","key":"26_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","volume":"5","author":"R Read","year":"1975","unstructured":"Read, R., Tarjan, R.: Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5(3), 237\u2013252 (1975). https:\/\/doi.org\/10.1002\/net.1975.5.3.237","journal-title":"Networks"},{"issue":"3","key":"26_CR16","doi-asserted-by":"publisher","first-page":"331","DOI":"10.15807\/jorsj.38.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). https:\/\/doi.org\/10.15807\/jorsj.38.331","journal-title":"J. Oper. Res. Soc. Jpn."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30448-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T23:05:13Z","timestamp":1684191913000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30448-4_26"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031304477","9783031304484"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30448-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Larnaca","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","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":"25","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":"51% - 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","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":"6","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)"}},{"value":"3 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}