{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:55Z","timestamp":1759637635755,"version":"3.41.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218397"},{"type":"electronic","value":"9783319218403"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21840-3_49","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T09:57:38Z","timestamp":1437991058000},"page":"593-605","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Constant Time Enumeration by Amortization"],"prefix":"10.1007","author":[{"given":"Takeaki","family":"Uno","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"key":"49_CR1","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 65, 21\u201346 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"49_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0304-3975(03)00221-4","volume":"307","author":"LS Chandran","year":"2003","unstructured":"Chandran, L.S., Ibarra, L., Ruskey, F., Sawada, J.: Generating and Characterizing the Perfect Elimination Orderings of a Chordal Graph. Theoretical Computer Science 307, 303\u2013317 (2003)","journal-title":"Theoretical Computer Science"},{"key":"49_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/3-540-52846-6_76","volume-title":"SWAT 90","author":"D Eppstein","year":"1990","unstructured":"Eppstein, D.: Finding the $$k$$ smallest spanning trees. In: Gilbert, J.R., Karlsson, R. (eds.) SWAT 90. LNCS, vol. 447, pp. 38\u201347. Springer, Heildelberg (1990)"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: Finding the $$k$$ shortest paths. In: FOCS 1994, pp. 154\u2013165 (1994)","DOI":"10.1109\/SFCS.1994.365697"},{"key":"49_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-23719-5_24","volume-title":"Algorithms \u2013 ESA 2011","author":"R Ferreira","year":"2011","unstructured":"Ferreira, R., Grossi, R., Rizzi, R.: Output-sensitive listing of bounded-size trees in undirected graphs. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 275\u2013286. Springer, Heidelberg (2011)"},{"key":"49_CR6","unstructured":"Frequent Itemset Mining Dataset Repository. http:\/\/fimi.cs.helsinki.fi\/data\/"},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Tarjan, R.E.: A Linear-time algorithm for a special case of disjoint set union, In: STOC 1983, pp. 246\u2013251 (1983)","DOI":"10.1145\/800061.808753"},{"key":"49_CR8","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1137\/S009753979225030X","volume":"24","author":"HN Kapoor","year":"1995","unstructured":"Kapoor, H.N., Ramesh, H.: Algorithms for Enumerating all Spanning Trees of Undirected and Weighted Graphs. SIAM J. on Computing 24, 247\u2013265 (1995)","journal-title":"SIAM J. on Computing"},{"key":"49_CR9","doi-asserted-by":"publisher","first-page":"3635","DOI":"10.1016\/j.tcs.2010.06.007","volume":"411","author":"Y Matsui","year":"2010","unstructured":"Matsui, Y., Uehara, R., Uno, T.: Enumeration of the Perfect Sequences of a Chordal Graph. Theoretical Computer Science 411, 3635\u20133641 (2010)","journal-title":"Theoretical Computer Science"},{"key":"49_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-61576-8_69","volume-title":"Combinatorics and Computer Science","author":"Y Matsui","year":"1995","unstructured":"Matsui, Y., Matsui, T.: Enumeration algorithm of the edge colorings in bipartite graphs. In: Deza, M., Euler, R., Manoussakis, L. (eds.) Combinatorics and Computer Science. LNCS, vol. 1120, pp. 18\u201326. Spinger, Heildelberg (1995)"},{"key":"49_CR11","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic Aspects of Vertex Elimination on Graphs. SIAM J. on Computing 5, 266\u2013283 (1976)","journal-title":"SIAM J. on Computing"},{"key":"49_CR12","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 Journal on Computing 26, 678\u2013692 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. In: STOC 1981, pp. 114\u2013122 (1981)","DOI":"10.1145\/800076.802464"},{"key":"49_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/3-540-48686-0_35","volume-title":"Computing and Combinatorics","author":"T Uno","year":"1999","unstructured":"Uno, T.: A new approach for speeding up enumeration algorithms and its application for matroid bases. In: Asano, T., Imai, H., Lee, D.T., Nakano, S., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, p. 349. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21840-3_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T18:50:38Z","timestamp":1748544638000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21840-3_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218397","9783319218403"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21840-3_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}