{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:48Z","timestamp":1759638168192},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229527"},{"type":"electronic","value":"9783642229534"}],"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-22953-4_26","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T12:28:08Z","timestamp":1313584088000},"page":"298-309","source":"Crossref","is-referenced-by-count":22,"title":["Enumeration of Minimal Dominating Sets and Variants"],"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"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"2167","DOI":"10.1016\/j.ejc.2007.04.013","volume":"28","author":"I. Adler","year":"2007","unstructured":"Adler, I., Gottlob, G., Grohe, M.: Hypertree-Width and Related Hypergraph Invariants. European Journal of Combinatorics\u00a028, 2167\u20132181 (2007)","journal-title":"European Journal of Combinatorics"},{"issue":"6","key":"26_CR2","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1109\/69.250074","volume":"5","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Database Mining: A Performance Perspective. IEEE Trans. Knowl. Data Eng.\u00a05(6), 914\u2013925 (1993)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"16","key":"26_CR3","doi-asserted-by":"publisher","first-page":"2350","DOI":"10.1016\/j.dam.2006.04.012","volume":"154","author":"E. Boros","year":"2006","unstructured":"Boros, E., Elbassioni, K., Khachiyan, L., Gurvich, V.: An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation. Discrete Applied Mathematics\u00a0154(16), 2350\u20132372 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1080\/10556789808805708","volume":"10","author":"E. Boros","year":"1998","unstructured":"Boros, E., Gurvich, V., Hammer, P.L.: Dual subimplicants of positive Boolean functions. Optimization Methods and Software\u00a010, 147\u2013156 (1998)","journal-title":"Optimization Methods and Software"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Bang Le, V., Spinrad, J.P.: Graph Classes a Survey. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (1999)","DOI":"10.1137\/1.9780898719796"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The Monadic Second-Order Logic of Graphs I: Recognizable Sets of Finite Graphs. Inf. Comput.\u00a085(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"26_CR7","doi-asserted-by":"publisher","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 Applied Mathematics\u00a0157, 2675\u20132700 (2009)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. Theory of Computing Systems\u00a033(2), 125\u2013150 (2000)","journal-title":"Theory of Computing Systems"},{"issue":"1-3","key":"26_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper Bounds to the Clique-Width of Graphs. Discrete Applied Mathematics\u00a0101(1-3), 77\u2013114 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"26_CR10","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)","edition":"3"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Eiter, T., Gottlob, G.: Identifying the Minimal Transversals of a Hypergraph and Related Problems. SIAM Journal on Computing 24(6), 1278\u20131304 (1995)","DOI":"10.1137\/S0097539793250299"},{"key":"26_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/3-540-45757-7_53","volume-title":"Logics in Artificial Intelligence","author":"T. Eiter","year":"2002","unstructured":"Eiter, T., Gottlob, G.: Hypergraph transversal computation and related problems in logic and AI. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol.\u00a02424, pp. 549\u2013564. Springer, Heidelberg (2002)"},{"issue":"2","key":"26_CR13","doi-asserted-by":"publisher","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 Journal on Computing\u00a032(2), 514\u2013537 (2003)","journal-title":"SIAM Journal on Computing"},{"issue":"11","key":"26_CR14","doi-asserted-by":"publisher","first-page":"2035","DOI":"10.1016\/j.dam.2007.04.017","volume":"156","author":"T. Eiter","year":"2008","unstructured":"Eiter, T., Makino, K., Gottlob, G.: Computational aspects of monotone dualization: A brief survey. Discrete Applied Mathematics\u00a0156(11), 2035\u20132049 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Grandoni, F., Pyatkin, A., Stepanov, A.: Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. ACM Transactions on Algorithms\u00a05(1) (2008)","DOI":"10.1145\/1435375.1435384"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L.: On the Enumeration of Minimal Dominating Sets and Related Notions (2011) (manuscript)","DOI":"10.1007\/978-3-642-22953-4_26"},{"issue":"3","key":"26_CR17","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"M. Fredman","year":"1996","unstructured":"Fredman, M., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms\u00a021(3), 618\u2013628 (1996)","journal-title":"Journal of Algorithms"},{"issue":"7","key":"26_CR18","doi-asserted-by":"publisher","first-page":"1447","DOI":"10.1016\/j.dam.2008.10.010","volume":"157","author":"A. G\u00e9ly","year":"2009","unstructured":"G\u00e9ly, A., Nourine, L., Sadi, B.: Enumeration aspects of maximal cliques and bicliques. Discrete Applied Mathematics\u00a0157(7), 1447\u20131459 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Information Processing Letters\u00a027, 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors V:Excluding a Planar Graph. J. Comb. Theory, Ser. B\u00a041, 92\u2013114 (1986)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"26_CR21","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N. Robertson","year":"2004","unstructured":"Robertson, N., Seymour, P.D.: Graph minors XX:Wagner\u2019s Conjecture. J. Comb. Theory, Ser. B\u00a092(2), 325\u2013357 (2004)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"4","key":"26_CR22","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s00493-007-2020-3","volume":"27","author":"S. Thomass\u00e9","year":"2007","unstructured":"Thomass\u00e9, S., Yeo, A.: Total domination of graphs and small transversals of hypergraphs. Combinatorica\u00a027(4), 473\u2013487 (2007)","journal-title":"Combinatorica"},{"key":"26_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis","author":"S. Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis. Cambridge University Press, Cambridge (1994)"},{"issue":"1-3","key":"26_CR24","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1023\/A:1016783217662","volume":"18","author":"J. Wu","year":"2001","unstructured":"Wu, J., Li, H.: A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks. Telecommunication Systems\u00a018(1-3), 13\u201336 (2001)","journal-title":"Telecommunication Systems"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22953-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T03:39:44Z","timestamp":1560483584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22953-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229527","9783642229534"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22953-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}