{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:15Z","timestamp":1759638855683},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531730"},{"type":"electronic","value":"9783662531747"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53174-7_11","type":"book-chapter","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T14:50:06Z","timestamp":1470322206000},"page":"138-153","source":"Crossref","is-referenced-by-count":9,"title":["A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs"],"prefix":"10.1007","author":[{"given":"Mamadou Moustapha","family":"Kant\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Limouzy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Mary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lhouari","family":"Nourine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"key":"11_CR1","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328. AAAI\/MIT Press (1996)"},{"issue":"6","key":"11_CR2","doi-asserted-by":"crossref","first-page":"2036","DOI":"10.1137\/S0097539700370072","volume":"30","author":"E Boros","year":"2000","unstructured":"Boros, E., Gurvich, V., Khachiyan, L., Makino, K.: Dual-bounded generating problems: partial and multiple transversals of a hypergraph. SIAM J. Comput. 30(6), 2036\u20132050 (2000)","journal-title":"SIAM J. Comput."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Boros, E., Gurvich, V., Khachiyan, L., Makino, K.: Generating weighted transversals of a hypergraph. In: Rutgers University, pp. 13\u201322 (2000)","DOI":"10.1007\/3-540-45022-X_50"},{"issue":"12","key":"11_CR4","doi-asserted-by":"crossref","first-page":"2675","DOI":"10.1016\/j.dam.2008.08.021","volume":"157","author":"B Courcelle","year":"2009","unstructured":"Courcelle, B.: Linear delay enumeration and monadic second-order logic. Discrete Appl. Math. 157(12), 2675\u20132700 (2009)","journal-title":"Discrete Appl. Math."},{"key":"11_CR5","volume-title":"Graph Theory (Graduate Texts in Mathematics)","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory (Graduate Texts in Mathematics). Springer, Heidelberg (2005)"},{"issue":"1\u20132","key":"11_CR6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"GA Dirac","year":"1961","unstructured":"Dirac, G.A.: On rigid circuit graphs. Abhandlungen Aus Dem Mathematischen Seminare der Universit\u00e4t Hamburg 25(1\u20132), 71\u201376 (1961)","journal-title":"Abhandlungen Aus Dem Mathematischen Seminare der Universit\u00e4t Hamburg"},{"issue":"6","key":"11_CR7","doi-asserted-by":"crossref","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24(6), 1278\u20131304 (1995)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"11_CR8","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1137\/S009753970240639X","volume":"32","author":"T Eiter","year":"2003","unstructured":"Eiter, T., Gottlob, G., Makino, K.: New results on monotone dualization and generating hypergraph transversals. SIAM J. Comput. 32(2), 514\u2013537 (2003)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"11_CR9","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"ML Fredman","year":"1996","unstructured":"Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21(3), 618\u2013628 (1996)","journal-title":"J. Algorithms"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/3-540-60618-1_88","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P Galinier","year":"1995","unstructured":"Galinier, P., Habib, M., Paul, C.: Chordal graphs and their clique graphs. In: Nagl, M. (ed.) WG 1995. LNCS, vol. 1017, pp. 358\u2013371. Springer, Heidelberg (1995)"},{"issue":"1","key":"11_CR11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theor. Ser. B 16(1), 47\u201356 (1974)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.dam.2014.12.010","volume":"199","author":"PA Golovach","year":"2015","unstructured":"Golovach, P.A., Heggernes, P., Kante, M.M., Kratsch, D., Villanger, Y.: Enumerating minimal dominating sets in chordal bipartite graphs. Discrete Appl. Math. 199, 30\u201336 (2015)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"11_CR13","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0041-5553(73)90011-6","volume":"13","author":"VA Gurvich","year":"1973","unstructured":"Gurvich, V.A.: On theory of multistep games. USSR Comput. Math. Math. Phys. 13(6), 143\u2013161 (1973)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/978-3-642-35261-4_32","volume-title":"Algorithms and Computation","author":"MM Kant\u00e9","year":"2012","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L.: On the neighbourhood helly of some graph classes and applications to the enumeration of minimal dominating sets. In: Chao, K.-M., Hsu, T., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 289\u2013298. Springer, Heidelberg (2012)"},{"issue":"4","key":"11_CR15","doi-asserted-by":"crossref","first-page":"1916","DOI":"10.1137\/120862612","volume":"28","author":"MM Kant\u00e9","year":"2014","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L.: On the enumeration of minimal dominating sets and related notions. SIAM J. Discrete Math. 28(4), 1916\u20131929 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/978-3-642-45030-3_32","volume-title":"Algorithms and Computation","author":"MM Kant\u00e9","year":"2013","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L., Uno, T.: On the enumeration and counting of minimal dominating sets in interval and permutation graphs. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) Algorithms and Computation. LNCS, vol. 8283, pp. 339\u2013349. Springer, Heidelberg (2013)"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/978-3-319-21840-3_37","volume-title":"Algorithms and Data Structures","author":"MM Kant\u00e9","year":"2015","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L., Uno, T.: Polynomial delay algorithm for listing minimal edge dominating sets in graphs. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 446\u2013457. Springer, Heidelberg (2015)"},{"key":"11_CR18","unstructured":"Mary, A.: \u00c9numeration des Dominants Minimaux d\u2019un graphe. Ph.D. thesis, Universit\u00e9 Blaise Pascal (2013)"},{"key":"11_CR19","series-title":"Game Theory, Mathematical Programming and Operations Research: Series C","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-2099-6","volume-title":"Coherent Structures and Simple Games. Theory and Decision Library","author":"KG Ramamurthy","year":"1990","unstructured":"Ramamurthy, K.G.: Coherent Structures and Simple Games. Theory and Decision Library. Game Theory, Mathematical Programming and Operations Research: Series C, vol. 6. Springer, Heidelberg (1990)"},{"key":"11_CR20","unstructured":"Strozecki, Y.: Enumeration Complexity and Matroid Decomposition. Ph.D. thesis, Universit\u00e9 Paris Diderot - Paris 7 (2010)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53174-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T04:53:00Z","timestamp":1568263980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53174-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531730","9783662531747"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53174-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}