{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:25:42Z","timestamp":1743085542238,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030250041"},{"type":"electronic","value":"9783030250058"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-25005-8_28","type":"book-chapter","created":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T23:02:23Z","timestamp":1563145343000},"page":"339-351","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs"],"prefix":"10.1007","author":[{"given":"Kazuhiro","family":"Kurita","sequence":"first","affiliation":[]},{"given":"Kunihiro","family":"Wasa","sequence":"additional","affiliation":[]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[]},{"given":"Hiroki","family":"Arimura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0022-0000(86)90018-8","volume":"33","author":"G Ausiello","year":"1986","unstructured":"Ausiello, G., D\u2019Atri, A., Moscarini, M.: Chordality properties on graphs and minimal conceptual connections in semantic data models. J. Comput. Syst. Sci. 33(2), 179\u2013202 (1986)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"28_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 Appl. Math. 65(1), 21\u201346 (1996)","journal-title":"Discrete Appl. Math."},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Spinrad, J.P., et al.: Graph Classes: A Survey, vol. 3. Siam, Philadelphia (1999)","DOI":"10.1137\/1.9780898719796"},{"issue":"3","key":"28_CR4","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1145\/2983573","volume":"49","author":"J Brault-Baron","year":"2016","unstructured":"Brault-Baron, J.: Hypergraph acyclicity revisited. ACM Comput. Surv. 49(3), 54 (2016)","journal-title":"ACM Comput. Surv."},{"key":"28_CR5","unstructured":"Conte, A., Grossi, R., Marino, A., Versari, L.: Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques. In: Proceedings of ICALP 2016. LIPIcs, vol. 55, pp. 148:1\u2013148:15 (2016)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-95891-8_19","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"T Daigo","year":"2009","unstructured":"Daigo, T., Hirata, K.: On generating all maximal acyclic subhypergraphs with polynomial delay. In: Nielsen, M., Ku\u010dera, A., Miltersen, P.B., Palamidessi, C., T\u016fma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 181\u2013192. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-95891-8_19"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"3-1","DOI":"10.1145\/2543629","volume":"18","author":"D Eppstein","year":"2013","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. J. Exp. Algorithmics 18, 3-1 (2013)","journal-title":"J. Exp. Algorithmics"},{"issue":"2\u20133","key":"28_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","volume":"43","author":"M Farber","year":"1983","unstructured":"Farber, M.: Characterizations of strongly chordal graphs. Discrete Math. 43(2\u20133), 173\u2013189 (1983)","journal-title":"Discrete Math."},{"issue":"5","key":"28_CR9","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1016\/j.jctb.2006.01.001","volume":"96","author":"Jing Huang","year":"2006","unstructured":"Huang, J.: Representation characterizations of chordal bipartite graphs. J. Comb. Theory Ser. B 96(5), 673\u2013683 (2006)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"3","key":"28_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"key":"28_CR11","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"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/11917496_7","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Kiyomi","year":"2006","unstructured":"Kiyomi, M., Kijima, S., Uno, T.: Listing chordal graphs and interval graphs. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 68\u201377. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11917496_7"},{"issue":"2","key":"28_CR13","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1093\/ietisy\/e89-d.2.763","volume":"89","author":"M Kiyomi","year":"2006","unstructured":"Kiyomi, M., Uno, T.: Generating chordal graphs included in given graphs. IEICE Trans. Inf. Syst. 89(2), 763\u2013770 (2006)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"28_CR14","unstructured":"Kurita, K., Wasa, K., Arimura, H., Uno, T.: Efficient enumeration of dominating sets for sparse graphs. In: Proceedings of ISAAC 2018, pp. 8:1\u20138:13 (2018)"},{"key":"28_CR15","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, 1082\u20131096 (1970)","journal-title":"Can. J. Math."},{"issue":"5","key":"28_CR16","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1137\/0216057","volume":"16","author":"A Lubiw","year":"1987","unstructured":"Lubiw, A.: Doubly lexical orderings of matrices. SIAM J. Comput. 16(5), 854\u2013879 (1987)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"28_CR17","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)","journal-title":"J. ACM"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1007\/3-540-45465-9_85","volume-title":"Automata, Languages and Programming","author":"R Uehara","year":"2002","unstructured":"Uehara, R.: Linear time algorithms on chordal bipartite and strongly chordal graphs. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 993\u20131004. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_85"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-319-94776-1_38","volume-title":"Computing and Combinatorics","author":"K Wasa","year":"2018","unstructured":"Wasa, K., Uno, T.: Efficient enumeration of bipartite subgraphs in graphs. In: Wang, L., Zhu, D. (eds.) COCOON 2018. LNCS, vol. 10976, pp. 454\u2013466. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94776-1_38"},{"key":"28_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-642-40897-7_21","volume-title":"Discovery Science","author":"K Wasa","year":"2013","unstructured":"Wasa, K., Uno, T., Hirata, K., Arimura, H.: Polynomial delay and space discovery of connected and acyclic sub-hypergraphs in a hypergraph. In: F\u00fcrnkranz, J., H\u00fcllermeier, E., Higuchi, T. (eds.) DS 2013. LNCS (LNAI), vol. 8140, pp. 308\u2013323. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40897-7_21"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25005-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:15:27Z","timestamp":1710350127000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-25005-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030250041","9783030250058"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25005-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2019.di.unipi.it\/","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":"73","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":"36","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":"49% - 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":"5-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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}