{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:21:57Z","timestamp":1725790917936},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_35","type":"book-chapter","created":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T23:02:27Z","timestamp":1395702147000},"page":"399-408","source":"Crossref","is-referenced-by-count":2,"title":["O(n) Time Algorithms for Dominating Induced Matching Problems"],"prefix":"10.1007","author":[{"given":"Min Chih","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel J.","family":"Mizrahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayme L.","family":"Szwarcfiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","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":"35_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-35261-4_30","volume-title":"Algorithms and Computation","author":"A. Brandst\u00e4dt","year":"2012","unstructured":"Brandst\u00e4dt, A., Leitert, A., Rautenbach, D.: Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. In: Chao, K.-M., Hsu, T.-S., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol.\u00a07676, pp. 267\u2013277. Springer, Heidelberg (2012)"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-25591-5_12","volume-title":"Algorithms and Computation","author":"A. Brandst\u00e4dt","year":"2011","unstructured":"Brandst\u00e4dt, A., Mosca, R.: Dominating Induced Matchings for P\n                  7-free Graphs in Linear Time. In: Asano, T., Nakano, S.-I., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol.\u00a07074, pp. 100\u2013109. Springer, Heidelberg (2011)"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.dam.2010.03.011","volume":"159","author":"D.M. Cardoso","year":"2011","unstructured":"Cardoso, D.M., Korpelainen, N., Lozin, V.V.: On the complexity of the dominating induced matching problem in hereditary classes of graphs. Discrete Applied Mathematics\u00a0159, 21\u2013531 (2011)","journal-title":"Discrete Applied Mathematics"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0020-0190(02)00268-5","volume":"84","author":"Z.-Z. Chen","year":"2002","unstructured":"Chen, Z.-Z., Zhang, S.: Tight upper bound on the number of edges in a bipartite K\n                  3,3-free or K\n                  5-free graph with an application. Information Processing Letters\u00a084, 141\u2013145 (2002)","journal-title":"Information Processing Letters"},{"key":"35_CR6","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.J., Sherwani, N.A., Holmes, N.D.: Efficient edge domination problems in graphs. Information Processing Letters\u00a048, 221\u2013228 (1993)","journal-title":"Information Processing Letters"},{"key":"35_CR7","unstructured":"Lin, M.C., Mizrahi, M.J., Szwarcfiter, J.L.: Exact algorithms for dominating induced matchings. CoRR, abs\/1301.7602 (2013)"},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-642-45030-3_52","volume-title":"Algorithms and Computation","author":"M.C. Lin","year":"2013","unstructured":"Lin, M.C., Mizrahi, M.J., Szwarcfiter, J.L.: An O\n                  *(1.1939\n                    n\n                  ) time algorithm for minimum weighted dominating induced matching. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) Algorithms and Computation. LNCS, vol.\u00a08283, pp. 558\u2013567. Springer, Heidelberg (2013)"},{"key":"35_CR9","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 Mathematics\u00a0119, 227\u2013250 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0166-218X(98)00057-2","volume":"87","author":"C.L. Lu","year":"1998","unstructured":"Lu, C.L., Tang, C.Y.: Solving the weighted efficient edge domination problem on bipartite permutation graphs. Discrete Applied Mathematics\u00a087, 203\u2013211 (1998)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T08:50:37Z","timestamp":1558860637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}