{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T06:29:31Z","timestamp":1726381771030},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121999"},{"type":"electronic","value":"9783642122002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12200-2_56","type":"book-chapter","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T13:53:05Z","timestamp":1271857985000},"page":"650-661","source":"Crossref","is-referenced-by-count":21,"title":["Efficient Edge Domination on Hole-Free Graphs in Polynomial Time"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[]},{"given":"Christian","family":"Hundt","sequence":"additional","affiliation":[]},{"given":"Ragnar","family":"Nevries","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"56_CR1","first-page":"83","volume":"58","author":"D. Bange","year":"1987","unstructured":"Bange, D., Barkauskas, A., Slater, P.: Efficient near-domination of graphs. Congr. Numer.\u00a058, 83\u201392 (1987)","journal-title":"Congr. Numer."},{"key":"56_CR2","first-page":"189","volume-title":"Applications of Discrete Mathematics","author":"D. Bange","year":"1988","unstructured":"Bange, D., Barkauskas, A., Slater, P.: Efficient domination sets in graphs. In: Ringeisen, R.D., Roberts, F.S. (eds.) Applications of Discrete Mathematics, pp. 189\u2013199. SIAM, Philadelphia (1988)"},{"key":"56_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0095-8956(73)90042-7","volume":"15","author":"N. Biggs","year":"1973","unstructured":"Biggs, N.: Perfect codes in graphs. J. Combin. Theory Ser. B\u00a015, 289\u2013296 (1973)","journal-title":"J. Combin. Theory Ser. B"},{"key":"56_CR4","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica\u00a011, 1\u201323 (1993)","journal-title":"Acta Cybernetica"},{"key":"56_CR5","series-title":"SIAM Monographs on Discrete Math. Appl.","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Math. Appl., vol.\u00a03. SIAM, Philadelphia (1999)"},{"key":"56_CR6","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. Cardozo","year":"2009","unstructured":"Cardozo, 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":"56_CR7","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, London (1980)"},{"key":"56_CR8","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"},{"key":"56_CR9","unstructured":"Laroche, P.: Planar monotone 1-in-3 satisfiability is NP-complete. In: ASMICS Workshop on Tilings, Deuxi\u00e8me Journ\u00e9es Polyominos et pavages, Ecole Normale Sup\u00e9rieure de Lyon (1992)"},{"key":"56_CR10","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":"56_CR11","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":"56_CR12","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":"56_CR13","unstructured":"Lu, C.L., Tang, C.Y.: Efficient domination in bipartite graphs (1997) (manuscript)"},{"key":"56_CR14","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 Math.\u00a087, 203\u2013211 (1998)","journal-title":"Discrete Applied Math."},{"issue":"2","key":"56_CR15","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-First Search and Linear Graph Algorithms. SIAM J. Comput.\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","LATIN 2010: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12200-2_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:05:40Z","timestamp":1619784340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12200-2_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121999","9783642122002"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12200-2_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}