{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:00:30Z","timestamp":1757311230031,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046507"},{"type":"electronic","value":"9783030046514"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_3","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T19:56:50Z","timestamp":1542311810000},"page":"35-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9822-6283","authenticated-orcid":false,"given":"Kunihiro","family":"Wasa","sequence":"first","affiliation":[]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"issue":"1\u20133","key":"3_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. Discret. Appl. Math. 65(1\u20133), 21\u201346 (1996). https:\/\/doi.org\/10.1016\/0166-218X(95)00026-N","journal-title":"Discret. Appl. Math."},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Bauer, R., Krug, M., Wagner, D.: Enumerating and generating labeled $$k$$-degenerate Graphs. In: ANALCO 2010, pp. 90\u201398. Society for Industrial and Applied Mathematics (2010). https:\/\/doi.org\/10.1137\/1.9781611973006.12","DOI":"10.1137\/1.9781611973006.12"},{"key":"3_CR3","unstructured":"Chartrand, G., Harary, F.: Planar permutation graphs. Annales de l\u2019institut Henri Poincar\u00e9 (B) Probabilit\u00e9s et Statistiques 3(4), 433\u2013438 (1967)"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Conte, A., Grossi, R., Marino, A., Versari, L.: Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques. In: ICALP 2016, pp. 148:1\u2013148:15 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.148","DOI":"10.4230\/LIPIcs.ICALP.2016.148"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-319-62389-4_13","volume-title":"Computing and Combinatorics","author":"A Conte","year":"2017","unstructured":"Conte, A., Kant\u00e9, M.M., Otachi, Y., Uno, T., Wasa, K.: Efficient enumeration of maximal k-degenerate subgraphs in a chordal graph. In: Cao, Y., Chen, J. (eds.) COCOON 2017. LNCS, vol. 10392, pp. 150\u2013161. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62389-4_13"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-20662-7_31","volume-title":"Experimental Algorithms","author":"D Eppstein","year":"2011","unstructured":"Eppstein, D., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 364\u2013375. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20662-7_31"},{"key":"3_CR7","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). https:\/\/doi.org\/10.1007\/978-3-642-23719-5_24"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/11917496_15","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G Goel","year":"2006","unstructured":"Goel, G., Gustedt, J.: Bounded arboricity to determine the local structure of sparse graphs. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 159\u2013167. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11917496_15"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-642-22953-4_26","volume-title":"Fundamentals of Computation Theory","author":"MM Kant\u00e9","year":"2011","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L.: Enumeration of minimal dominating sets and variants. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol. 6914, pp. 298\u2013309. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22953-4_26"},{"issue":"5","key":"3_CR10","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.4153\/CJM-1970-125-1","volume":"22","author":"DR Lick","year":"1970","unstructured":"Lick, D.R., White, A.T.: $$k$$-degenerate graphs. Can. J. Math. 22(5), 1082\u20131096 (1970). https:\/\/doi.org\/10.4153\/CJM-1970-125-1","journal-title":"Can. J. Math."},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30(3), 417\u2013427 (1983). https:\/\/doi.org\/10.1145\/2402.322385","journal-title":"J. ACM"},{"key":"3_CR12","unstructured":"Wasa, K.: Enumeration of enumeration algorithms. CoRR abs\/1605.05102 (2016), http:\/\/arxiv.org\/abs\/1605.05102"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-319-13075-0_8","volume-title":"Algorithms and Computation","author":"K Wasa","year":"2014","unstructured":"Wasa, K., Arimura, H., Uno, T.: Efficient enumeration of induced subtrees in a K-degenerate graph. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 94\u2013102. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13075-0_8"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-642-32241-9_30","volume-title":"Computing and Combinatorics","author":"K Wasa","year":"2012","unstructured":"Wasa, K., Kaneta, Y., Uno, T., Arimura, H.: Constant time enumeration of bounded-size subtrees in trees and its application. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 347\u2013359. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32241-9_30"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:46:25Z","timestamp":1710344785000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}