{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:02:20Z","timestamp":1648771340036},"reference-count":18,"publisher":"EDP Sciences","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1051\/ita\/2014026","type":"journal-article","created":{"date-parts":[[2015,1,9]],"date-time":"2015-01-09T03:39:43Z","timestamp":1420774783000},"page":"541-549","source":"Crossref","is-referenced-by-count":0,"title":["Domination problems on P<sub>5<\/sub>-free graphs"],"prefix":"10.1051","volume":"48","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"}]}],"member":"250","published-online":{"date-parts":[[2015,1,12]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"Bacso G. and Tuza Zs., Dominating cliques inP5-free graphs.Period. Math. Hung.21(1990) 303\u2013308.","DOI":"10.1007\/BF02352694"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Bertossi A.A., Dominating sets for split and bipartite graphs.Inf. Process. Lett.19(1984) 37\u201340.","DOI":"10.1016\/0020-0190(84)90126-1"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"Booth K.S. and Howard Johnson J., Dominating sets in chordal graphs.SIAM J. Comput.11(1982) 191\u2013199.","DOI":"10.1137\/0211015"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Chang Maw-Shang, Efficient algorithms for the domination problems on interval and circular-arc graphs.SIAM J. Comput.27(1998) 1671\u20131694.","DOI":"10.1137\/S0097539792238431"},{"key":"R5","unstructured":"Chao H.S., Hsu Fang-Rong and C.T. Lee Richard, An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs.Discrete Appl. Math.102(2000) 159\u2013173."},{"key":"R6","unstructured":"Chiba N. and Nishizeki T., Arboricity and subgraph listing algorithms.SIAM J. Comput.14(1985) 210\u2013223."},{"key":"R7","doi-asserted-by":"crossref","unstructured":"Cockayne E.J., Dreyer P.A., Hedetniemi S.M. and Hedetniemi S.T., Roman domination in graphs.Discrete Math.278(2004) 11\u201322.","DOI":"10.1016\/j.disc.2003.06.004"},{"key":"R8","unstructured":"Cooper C., Klasing R. and Zito M., Lower bounds and algorithms for dominating sets in web graphs.Internet Math.2(2005) 275\u2013300."},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Farber M. and Mark Keil J., Domination in permutation graphs.J. Algorithms6(1985) 309\u2013321.","DOI":"10.1016\/0196-6774(85)90001-X"},{"key":"R10","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness,Series of Books in Math. Sci. W.H. Freeman (1979)."},{"key":"R11","unstructured":"Haynes T.W., Hedetniemi S.M., Hedetniemi S.T. and Henning M.A., Domination in graphs applied to electric power networks.SIAM J. Discrete Math.15(2002) 519\u2013529."},{"key":"R12","unstructured":"T.W. Haynes, P.J. Slater and S.T. Hedetniemi, Fundamentals of domination in graphs. Includes bibliographical references and index (1998) 355\u2013438."},{"key":"R13","unstructured":"Kratsch D., Domination and total domination on asteroidal triple-free graphs.Discrete Appl. Math.99(2000) 111\u2013123."},{"key":"R14","unstructured":"Liedloff M., Kloks T., Liu J., Peng S.-L., Efficient algorithms for roman domination on some classes of graphs.Discrete Appl. Math.156(2008) 3400\u20133415."},{"key":"R15","unstructured":"M\u00fcller H. and Brandst\u00e4dt A., The np-completeness of steiner tree and dominating set for chordal bipartite graphs.Theoret. Comput. Sci.53(1987) 257\u2013265."},{"key":"R16","unstructured":"Nicolai F. and Szymczak T., Homogeneous sets and domination: A linear time algorithm for distance \u2013 hereditary graphs.Networks37(2001) 117\u2013128."},{"key":"R17","unstructured":"J. Wu and H. Li, Domination and its applications in ad hoc wireless networks with unidirectional links. InProc. of International Conference on Parallel Processing(2000)."},{"key":"R18","unstructured":"Zverovich I. E.. The domination number of (Kp, P5)-free graphs.Australas. J. Combin.27(2003) 95\u2013100."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2014026\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T09:17:47Z","timestamp":1566206267000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2014026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12]]},"references-count":18,"journal-issue":{"issue":"5"},"alternative-id":["ita140024"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2014026","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12]]}}}