{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:56:50Z","timestamp":1725638210634},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"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-25591-5_12","type":"book-chapter","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T00:32:34Z","timestamp":1322872354000},"page":"100-109","source":"Crossref","is-referenced-by-count":9,"title":["Dominating Induced Matchings for P 7-free Graphs in Linear Time"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raffaele","family":"Mosca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley (1974)"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H.-J. Bandelt","year":"1986","unstructured":"Bandelt, H.-J., Mulder, H.M.: Distance-hereditary graphs. J. Combin. Th (B)\u00a041, 182\u2013208 (1986)","journal-title":"J. Combin. Th. (B)"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2005.09.026","volume":"349","author":"H.L. Bodlaender","year":"2005","unstructured":"Bodlaender, H.L., Brandst\u00e4dt, A., Kratsch, D., Rao, M., Spinrad, J.: On algorithms for (P 5, gem)-free graphs. Theor. Comput. Sci.\u00a0349, 2\u201321 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1007\/978-3-642-12200-2_56","volume-title":"LATIN 2010: Theoretical Informatics","author":"A. Brandst\u00e4dt","year":"2010","unstructured":"Brandst\u00e4dt, A., Hundt, C., Nevries, R.: Efficient Edge Domination on Hole-Free Graphs in Polynomial Time. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 650\u2013661. Springer, Heidelberg (2010)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.dam.2004.01.009","volume":"145","author":"A. Brandst\u00e4dt","year":"2005","unstructured":"Brandst\u00e4dt, A., Kratsch, D.: On the structure of (P 5,gem)-free graphs. Discrete Applied Mathematics\u00a0145, 155\u2013166 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.dam.2004.01.014","volume":"145","author":"A. Brandst\u00e4dt","year":"2005","unstructured":"Brandst\u00e4dt, A., Le, H.-O., Mosca, R.: Chordal co-gem-free and (P 5,gem)-free graphs have bounded clique-width. Discrete Applied Mathematics\u00a0145, 232\u2013241 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Mosca, R.: Dominating induced matchings for P 7-free graphs in linear time, Technical report CoRR, arXiv:1106.2772v1 [cs.DM] (2011)","DOI":"10.1007\/978-3-642-25591-5_12"},{"issue":"4","key":"12_CR8","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1137\/060664690","volume":"22","author":"A. Bretscher","year":"2008","unstructured":"Bretscher, A., Corneil, D.G., Habib, M., Paul, C.: A Simple Linear Time LexBFS Cograph Recognition Algorithm. SIAM J. Discrete Math.\u00a022(4), 1277\u20131296 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Cardozo, D.M., Korpelainen, N., Lozin, V.V.: On the complexity of the dominating induced matching problem in hereditary classes of graphs. Electronically Available in Discrete Applied Math. (2011)","DOI":"10.1016\/j.dam.2010.03.011"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-02029-2_8","volume-title":"Graph Theory, Computational Intelligence and Thought","author":"D.M. Cardoso","year":"2009","unstructured":"Cardoso, D.M., Lozin, V.V.: Dominating Induced Matchings. In: Lipshteyn, M., Levit, V.E., McConnell, R.M. (eds.) Graph Theory, Computational Intelligence and Thought. LNCS, vol.\u00a05420, pp. 77\u201386. Springer, Heidelberg (2009)"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D.G. Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Computing\u00a014, 926\u2013934 (1985)","journal-title":"SIAM J. Computing"},{"key":"12_CR12","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, 125\u2013150 (2000)","journal-title":"Theory of Computing Systems"},{"key":"12_CR13","volume-title":"Computers and Intractability \u2013 A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability \u2013 A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0020-0190(93)90084-M","volume":"48","author":"D.L. Grinstead","year":"1993","unstructured":"Grinstead, D.L., Slater, P.L., Sherwani, N.A., Holmes, N.D.: Efficient edge domination problems in graphs. Information Processing Letters\u00a048, 221\u2013228 (1993)","journal-title":"Information Processing Letters"},{"issue":"6","key":"12_CR15","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Efficient Algorithms for Graph Manipulation [H]. Communications of the ACM\u00a016(6), 372\u2013378 (1973)","journal-title":"Communications of the ACM"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BFb0045090","volume-title":"Computing and Combinatorics","author":"Y.D. Liang","year":"1997","unstructured":"Liang, Y.D., Lu, C.L., Tang, C.Y.: Efficient Domination on Permutation Graphs and Trapezoid Graphs. In: Jiang, T., Lee, D.T. (eds.) COCOON 1997. LNCS, vol.\u00a01276, pp. 232\u2013241. Springer, Heidelberg (1997)"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Livingston, M., Stout, Q.: Distributing resources in hypercube computers. In: Proceedings 3rd Conf. on Hypercube Concurrent Computers and Applications, pp. 222\u2013231 (1988)","DOI":"10.1145\/62297.62324"},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0166-218X(01)00198-6","volume":"119","author":"C.L. Lu","year":"2002","unstructured":"Lu, C.L., Ko, M.-T., Tang, C.Y.: Perfect edge domination and efficient edge domination in graphs. Discrete Applied Math.\u00a0119(3), 227\u2013250 (2002)","journal-title":"Discrete Applied Math."},{"key":"12_CR19","unstructured":"Lu, C.L., Tang, C.Y.: Efficient domination in bipartite graphs (1997) (manuscript)"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R.M. McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Math.\u00a0201, 189\u2013241 (1999)","journal-title":"Discrete Math."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Spinrad, J.P.: Efficient Graph Representations, Fields Institute Monographs. American Math. Society (2003)","DOI":"10.1090\/fim\/019"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T06:11:25Z","timestamp":1561011085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}