{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:53:06Z","timestamp":1725583986169},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_4","type":"book-chapter","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T00:43:48Z","timestamp":1369097028000},"page":"12-16","source":"Crossref","is-referenced-by-count":0,"title":["An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Krzywkowski","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Inclusion-exclusion algorithms for counting set partitions. In: Proceedings of FOCS, pp. 575\u2013582 (2006)","DOI":"10.1109\/FOCS.2006.41"},{"key":"4_CR2","first-page":"309","volume":"42","author":"M. Blidia","year":"2008","unstructured":"Blidia, M., Favaron, O., Lounes, R.: Locating-domination, 2-domination and\u00a0independence in trees. Australasian Journal of Combinatorics\u00a042, 309\u2013316 (2008)","journal-title":"Australasian Journal of Combinatorics"},{"key":"4_CR3","first-page":"273","volume":"35","author":"D. Br\u00f3d","year":"2006","unstructured":"Br\u00f3d, D., Skupie\u0144, Z.: Trees with extremal numbers of dominating sets. Australasian Journal of Combinatorics\u00a035, 273\u2013290 (2006)","journal-title":"Australasian Journal of Combinatorics"},{"key":"4_CR4","first-page":"1739","volume":"4","author":"D. Br\u00f3d","year":"2009","unstructured":"Br\u00f3d, D., W\u0142och, A., W\u0142och, I.: On the number of minimal dominating sets including the set of leaves in trees. International Journal of Contemporary Mathematical Sciences\u00a04, 1739\u20131748 (2009)","journal-title":"International Journal of Contemporary Mathematical Sciences"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-27660-6_17","volume-title":"SOFSEM 2012: Theory and Practice of Computer Science","author":"J.-F. Couturier","year":"2012","unstructured":"Couturier, J.-F., Heggernes, P., van\u2019t Hof, P., Kratsch, D.: Minimal dominating sets in graph classes: combinatorial bounds and enumeration. In: Bielikov\u00e1, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Tur\u00e1n, G. (eds.) SOFSEM 2012. LNCS, vol.\u00a07147, pp. 202\u2013213. Springer, Heidelberg (2012)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.7155\/jgaa.00064","volume":"7","author":"D. Eppstein","year":"2003","unstructured":"Eppstein, D.: Small maximal independent sets and faster exact graph coloring. Journal of Graph Algorithms and Applications\u00a07, 131\u2013140 (2003)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"4_CR7","unstructured":"Fink, J., Jacobson, M.: n-domination in graphs. In: Graph Theory with Applications to Algorithms and Computer Science, pp. 282\u2013300. Wiley, New York (1985)"},{"key":"4_CR8","first-page":"17","volume":"5","author":"F. Fomin","year":"2009","unstructured":"Fomin, F., Grandoni, F., Pyatkin, A., Stepanov, A.: Combinatorial bounds via measure and conquer: bounding minimal dominating sets and applications. ACM Transactions on Algorithms 5, article 9, 17 (2009)","journal-title":"ACM Transactions on Algorithms"},{"key":"4_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"F. Fomin","year":"2010","unstructured":"Fomin, F., Kratsch, D.: Exact Exponential Algorithms. Springer, Berlin (2010)"},{"key":"4_CR10","first-page":"265","volume":"40","author":"J. Fujisawa","year":"2008","unstructured":"Fujisawa, J., Hansberg, A., Kubo, T., Saito, A., Sugita, M., Volkmann, L.: Independence and 2-domination in bipartite graphs. Australasian Journal of Combinatorics\u00a040, 265\u2013268 (2008)","journal-title":"Australasian Journal of Combinatorics"},{"key":"4_CR11","volume-title":"Fundamentals of Domination in Graphs","author":"T. Haynes","year":"1998","unstructured":"Haynes, T., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)"},{"volume-title":"Domination in Graphs: Advanced Topics","year":"1998","key":"4_CR12","unstructured":"Haynes, T., Hedetniemi, S., Slater, P. (eds.): Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)"},{"key":"4_CR13","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":"M. Kant\u00e9","year":"2011","unstructured":"Kant\u00e9, 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.\u00a06914, pp. 298\u2013309. Springer, Heidelberg (2011)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Koivisto, M.: An \n                    \n                      \n                    \n                    $\\mathcal{O}(2^n)$\n                   algorithm for graph coloring and other partitioning problems via inclusion-exclusion. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 583\u2013590. IEEE (2006)","DOI":"10.1109\/FOCS.2006.11"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.ipl.2013.01.020","volume":"113","author":"M. Krzywkowski","year":"2013","unstructured":"Krzywkowski, M.: Trees having many minimal dominating sets. Information Processing Letters\u00a0113, 276\u2013279 (2013)","journal-title":"Information Processing Letters"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0020-0190(76)90065-X","volume":"5","author":"E. Lawler","year":"1976","unstructured":"Lawler, E.: A note on the complexity of the chromatic number problem. Information Processing Letters\u00a05, 66\u201367 (1976)","journal-title":"Information Processing Letters"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"J. Moon","year":"1965","unstructured":"Moon, J., Moser, L.: On cliques in graphs. Israel Journal of Mathematics\u00a03, 23\u201328 (1965)","journal-title":"Israel Journal of Mathematics"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1080\/00207160701690284","volume":"86","author":"R. Shaheen","year":"2009","unstructured":"Shaheen, R.: Bounds for the 2-domination number of toroidal grid graphs. International Journal of Computer Mathematics\u00a086, 584\u2013588 (2009)","journal-title":"International Journal of Computer Mathematics"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1137\/0607015","volume":"7","author":"H. Wilf","year":"1986","unstructured":"Wilf, H.: The number of maximal independent sets in a tree. SIAM Journal on\u00a0Algebraic and Discrete Methods\u00a07, 125\u2013130 (1986)","journal-title":"SIAM Journal on\u00a0Algebraic and Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T03:20:23Z","timestamp":1557717623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}