{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:53:21Z","timestamp":1773276801857,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642237188","type":"print"},{"value":"9783642237195","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_24","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T13:14:33Z","timestamp":1314710073000},"page":"275-286","source":"Crossref","is-referenced-by-count":12,"title":["Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs"],"prefix":"10.1007","author":[{"given":"Rui","family":"Ferreira","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0959-440X(03)00031-9","volume":"13","author":"E. Alm","year":"2003","unstructured":"Alm, E., Arkin, A.P.: Biological networks. Current Opinion in Structural Biology\u00a013(2), 193\u2013202 (2003)","journal-title":"Current Opinion in Structural Biology"},{"issue":"1-3","key":"24_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D. Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Applied Mathematics\u00a065(1-3), 21\u201346 (1996)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"24_CR3","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1137\/0207024","volume":"7","author":"H.N. Gabow","year":"1978","unstructured":"Gabow, H.N., Myers, E.W.: Finding all spanning trees of directed and undirected graphs. SIAM Journal on Computing\u00a07(3), 280\u2013287 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR4","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 Journal on Computing\u00a024, 247\u2013265 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R. Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: Simple building blocks of complex networks. Science\u00a0298, 824\u2013827 (2002)","journal-title":"Science"},{"issue":"1","key":"24_CR6","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 Transactions on Circuit Theory\u00a012(1), 120 (1965)","journal-title":"IEEE Transactions on Circuit Theory"},{"key":"24_CR7","unstructured":"Moon, J.: Counting Labelled Trees, Canadian Mathematical Monographs, No. 1. Canadian Mathematical Congress, Montreal (1970)"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-30559-0_3","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S.I. Nakano","year":"2004","unstructured":"Nakano, S.I., Uno, T.: Constant time generation of trees with specified diameter. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) Graph -Theoretic Concepts in Computer Science. LNCS, vol.\u00a03353, pp. 33\u201345. Springer, Heidelberg (2004)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Read, R.C., Tarjan, R.E.: Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks (1975)","DOI":"10.1002\/net.1975.5.3.237"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1137\/S0097539794270881","volume":"26","author":"A. Shioura","year":"1994","unstructured":"Shioura, A., Tamura, A., Uno, T.: An optimal algorithm for scanning all spanning trees of undirected graphs. SIAM Journal on Computing\u00a026, 678\u2013692 (1994)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,12]],"date-time":"2018-10-12T02:50:29Z","timestamp":1539312629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}