{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:53:53Z","timestamp":1725742433326},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401633"},{"type":"electronic","value":"9783642401640"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40164-0_19","type":"book-chapter","created":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T01:01:30Z","timestamp":1374454890000},"page":"183-194","source":"Crossref","is-referenced-by-count":1,"title":["On Independence Domination"],"prefix":"10.1007","author":[{"given":"Wing-Kai","family":"Hon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ton","family":"Kloks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsiang-Hsuan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheung-Hung","family":"Poon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue-Li","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s004930200016","volume":"22","author":"R. Aharoni","year":"2002","unstructured":"Aharoni, R., Berger, E., Ziv, R.: A tree version of K\u0151nig\u2019s theorem. Combinatorica\u00a022, 335\u2013343 (2002)","journal-title":"Combinatorica"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"1766","DOI":"10.1016\/j.disc.2008.02.025","volume":"309","author":"R. Aharoni","year":"2009","unstructured":"Aharoni, R., Szab\u00f3, T.: Vizing\u2019s conjecture for chordal graphs. Discrete Mathematics\u00a0309, 1766\u20131768 (2009)","journal-title":"Discrete Mathematics"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B. Baker","year":"1994","unstructured":"Baker, B.: Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM\u00a041, 153\u2013180 (1994)","journal-title":"Journal of the ACM"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1002\/net.3230020103","volume":"2","author":"K. Baker","year":"1971","unstructured":"Baker, K., Fishburn, P., Roberts, F.: Partial orders of dimension 2. Networks\u00a02, 11\u201328 (1971)","journal-title":"Networks"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0020-0190(84)90126-1","volume":"19","author":"A. Bertossi","year":"1984","unstructured":"Bertossi, A.: Dominating sets for split and bipartite graphs. Information Processing Letters\u00a019, 37\u201340 (1984)","journal-title":"Information Processing Letters"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H. Bodlaender","year":"1998","unstructured":"Bodlaender, H.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science\u00a0209, 1\u201345 (1998)","journal-title":"Theoretical Computer Science"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1137\/0211015","volume":"11","author":"K. Booth","year":"1982","unstructured":"Booth, K., Johnson, J.: Domination in chordal graphs. SIAM Journal on Computing\u00a011, 191\u2013199 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D. Corneil","year":"1981","unstructured":"Corneil, D., Lerchs, H., Stewart-Burlingham, L.: Complement reducible graphs. Discrete Applied Mathematics\u00a03, 163\u2013174 (1981)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR9","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. Information and Computation\u00a085, 12\u201375 (1990)","journal-title":"Information and Computation"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Cygan, M., Pilipczuk, M., Pilipczuk, M.: Known algorithms for edge clique cover are probably optimal. Manuscript on ArXiV: 1203.1754v1 (2012)","DOI":"10.1137\/1.9781611973105.75"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(00)00234-6","volume":"263","author":"G. Damiand","year":"2001","unstructured":"Damiand, G., Habib, M., Paul, C.: A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. Theoretical Computer Science\u00a0263, 99\u2013111 (2001)","journal-title":"Theoretical Computer Science"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0166-218X(94)90165-1","volume":"50","author":"G. Domke","year":"1994","unstructured":"Domke, G., Fisher, D., Ryan, J., Majumdar, A.: Fractional domination of strong direct products. Discrete Applied Mathematics\u00a050, 89\u201391 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","volume":"7","author":"M. Farber","year":"1984","unstructured":"Farber, M.: Domination, independent domination, and duality in strongly chordal graphs. Discrete Applied Mathematics\u00a07, 115\u2013136 (1984)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1137\/S0895480191217806","volume":"7","author":"D. Fisher","year":"1984","unstructured":"Fisher, D.: Domination, fractional domination, 2-packings, and graph products. SIAM Journal on Discrete Mathematics\u00a07, 493\u2013498 (1984)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Fomin, F., Kratsch, D.: Exact exponential algorithms. EATCS series, Texts in Theoretical Computer Science. Springer (2010)","DOI":"10.1007\/978-3-642-16533-7"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Golumbic, M.: Algorithmic graph theory and perfect graphs. Annals of Discrete Mathematics, vol.\u00a057. Elsevier (2004)","DOI":"10.1016\/S0167-5060(04)80059-1"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0012-365X(82)90085-1","volume":"41","author":"D. Gregory","year":"1982","unstructured":"Gregory, D., Pullman, N.: On a clique covering problem of Orlin. Discrete Mathematics\u00a041, 97\u201399 (1982)","journal-title":"Discrete Mathematics"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/0095-8956(86)90087-0","volume":"40","author":"M. Gr\u00f6tschel","year":"1986","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Relaxations of vertex packing. Journal of Combinatorial Theory, Series B\u00a040, 330\u2013343 (1986)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF01917434","volume":"8","author":"R. Halin","year":"1976","unstructured":"Halin, R.: S-functions for graphs. Journal of Geometry\u00a08, 171\u2013186 (1976)","journal-title":"Journal of Geometry"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Hammack, R., Imrich, W., Klavzar, S.: Handbook of Product Graphs. CRC Press (2011)","DOI":"10.1201\/b10959"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","volume":"28","author":"E. Howorka","year":"1977","unstructured":"Howorka, E.: A characterization of distance-hereditary graphs. The Quarterly Journal of Mathematics\u00a028, 417\u2013420 (1977)","journal-title":"The Quarterly Journal of Mathematics"},{"key":"19_CR22","volume-title":"Product graphs: structure and recognition","author":"W. Imrich","year":"2000","unstructured":"Imrich, W., Klav\u017ear, S.: Product graphs: structure and recognition. John Wiley & Sons, New York (2000)"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Kloks, T.: Treewidth \u2013 Computations and Approximations. LNCS, vol.\u00a0842. Springer (1994)","DOI":"10.1007\/BFb0045375"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-642-11440-3_19","volume-title":"WALCOM: Algorithms and Computation","author":"L.-J. Hung","year":"2010","unstructured":"Hung, L.-J., Kloks, T.: On some simple widths. In: Rahman, M. S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol.\u00a05942, pp. 204\u2013215. Springer, Heidelberg (2010)"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Kloks, T., Liu, C., Poon, S.: On edge-independent sets (2013) (manuscript)","DOI":"10.1007\/978-3-642-38756-2_28"},{"key":"19_CR26","unstructured":"Kloks, T., Wang, Y.: Advances in graph algorithms (2013) (Manuscript)"},{"key":"19_CR27","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM Journal on Computing\u00a011, 329\u2013343 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On the Shannon capacity of a graph. IEEE Transactions on Information Theory\u00a0IT-25, 1\u20137 (1979)","journal-title":"IEEE Transactions on Information Theory IT-"},{"key":"19_CR29","doi-asserted-by":"crossref","first-page":"89","DOI":"10.26493\/1855-3974.282.71c","volume":"6","author":"M. Milani\u010d","year":"2013","unstructured":"Milani\u010d, M.: A note on domination and independence-domination numbers of graphs. Ars Mathematica Contemporanea\u00a06, 89\u201397 (2013)","journal-title":"Ars Mathematica Contemporanea"},{"key":"19_CR30","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":"19_CR31","unstructured":"Oum, S.: Graphs of bounded rank-width, PhD Thesis, Princeton University (2005)"},{"key":"19_CR32","volume-title":"Fractional graph theory","author":"E. Scheinerman","year":"1997","unstructured":"Scheinerman, E., Ullman, D.: Fractional graph theory. Wiley\u2013Interscience, New York (1997)"},{"key":"19_CR33","doi-asserted-by":"crossref","first-page":"8","DOI":"10.37236\/15","volume":"19","author":"S. Suen","year":"2012","unstructured":"Suen, S., Tarr, J.: An improved inequality related to Vizing\u2019s conjecture. The Electronic Journal of Combinatorics\u00a019, 8 (2012)","journal-title":"The Electronic Journal of Combinatorics"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Tedder, M., Corneil, D., Habib, M., Paul, C.: Simpler linear-time modular decomposition via recursive factorizing permutations. Manuscript on ArXiv: 0710.3901 (2008)","DOI":"10.1007\/978-3-540-70575-8_52"},{"key":"19_CR35","unstructured":"Telle, J.: Vertex partitioning problems: characterization, complexity and algorithms on partial k-trees, PhD Thesis, University of Oregon (1994)"},{"key":"19_CR36","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM Journal on Computing\u00a06, 505\u2013517 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR37","unstructured":"Vizing, V.: Cartesian product of graphs. Vychisl. Sistemy, 209\u2013212 (1963) (Russian)"},{"key":"19_CR38","first-page":"117","volume":"23","author":"V. Vizing","year":"1968","unstructured":"Vizing, V.: Some unsolved problems in graph theory. Uspehi Mat. Nauk\u00a023, 117\u2013134 (1968) (Russian)","journal-title":"Uspehi Mat. Nauk"}],"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-40164-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T09:57:28Z","timestamp":1596189448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40164-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401633","9783642401640"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40164-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}