{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T06:06:17Z","timestamp":1784613977555,"version":"3.55.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0020-0190(03)00233-3","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"45-50","source":"Crossref","is-referenced-by-count":76,"title":["k-tuple domination in graphs"],"prefix":"10.1016","volume":"87","author":[{"given":"Chung-Shou","family":"Liao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerard J.","family":"Chang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(03)00233-3_BIB001","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0196-6774(84)90028-2","article-title":"Characterization of totally balanced matrices","volume":"5","author":"Anstee","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(03)00233-3_BIB002","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-218X(88)90120-5","article-title":"Labeling algorithms for domination problems in sun-free chordal graphs","volume":"22","author":"Chang","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(03)00233-3_BIB003","first-page":"339","article-title":"Algorithmic aspects of domination in graphs","volume":"3","author":"Chang","year":"1998"},{"key":"10.1016\/S0020-0190(03)00233-3_BIB004","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1137\/0605034","article-title":"The k-domination and k-stability on sun-free chordal graphs","volume":"5","author":"Chang","year":"1984","journal-title":"SIAM J. Alg. Discrete Methods"},{"key":"10.1016\/S0020-0190(03)00233-3_BIB005","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0190(75)90011-3","article-title":"A linear algorithm for the domination number of a tree","volume":"4","author":"Cockayne","year":"1975","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(03)00233-3_BIB006","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","article-title":"Domination, independent domination and duality in strongly chordal graphs","volume":"7","author":"Farber","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(03)00233-3_BIB007","series-title":"Graph Theory with Applications to Algorithms and Computer Science","first-page":"283","article-title":"n-domination in graphs","author":"Fink","year":"1984"},{"key":"10.1016\/S0020-0190(03)00233-3_BIB008","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0012-365X(94)00373-Q","article-title":"Nordhaus\u2013Gaddum inequalities for domination in graphs","volume":"155","author":"Harary","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(03)00233-3_BIB009","first-page":"201","article-title":"Double domination in graphs","volume":"55","author":"Harary","year":"2000","journal-title":"Ars Combin."},{"key":"10.1016\/S0020-0190(03)00233-3_BIB010","series-title":"Domination in Graphs: The Theory","author":"Haynes","year":"1998"},{"key":"10.1016\/S0020-0190(03)00233-3_BIB011","series-title":"Domination in Graphs: Advanced Topics","author":"Haynes","year":"1998"},{"key":"10.1016\/S0020-0190(03)00233-3_BIB012","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0606070","article-title":"Totally-balanced and greedy matrices","volume":"6","author":"Hoffman","year":"1985","journal-title":"SIAM J. Alg. Discrete Methods"},{"key":"10.1016\/S0020-0190(03)00233-3_BIB013","doi-asserted-by":"crossref","first-page":"51","DOI":"10.7151\/dmgt.1006","article-title":"The edge domination problem","volume":"15","author":"Hwang","year":"1995","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/S0020-0190(03)00233-3_BIB014","series-title":"Graph Theory, Combin., Algorithms, and Applications","first-page":"319","article-title":"On n-total domination number in graphs","author":"Kulli","year":"1991"},{"key":"10.1016\/S0020-0190(03)00233-3_BIB015","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1137\/0605040","article-title":"On the algorithm complexity of total domination","volume":"5","author":"Laskar","year":"1984","journal-title":"SIAM J. Alg. Discrete Methods"},{"key":"10.1016\/S0020-0190(03)00233-3_BIB016","doi-asserted-by":"crossref","unstructured":"C.S. Liao, k-tuple domination in graphs, Master Thesis, Dept. Appl. Math., National Chiao Tung Univ., June 2002","DOI":"10.11650\/twjm\/1500558307"},{"key":"10.1016\/S0020-0190(03)00233-3_BIB017","doi-asserted-by":"crossref","first-page":"415","DOI":"10.11650\/twjm\/1500558307","article-title":"Algorithmic aspect of k-tuple domination in graphs","volume":"6","author":"Liao","year":"2002","journal-title":"Taiwanese J. Math."},{"key":"10.1016\/S0020-0190(03)00233-3_BIB018","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1137\/0216057","article-title":"Doubly lexical ordering of matrices","volume":"16","author":"Lubiw","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(03)00233-3_BIB019","series-title":"Proc. 8th S.E. Conf. Combin., Graph Theory and Comput., Utilitas Math., Winnipeg","first-page":"489","article-title":"Edge domination in trees","author":"Mitchell","year":"1977"},{"key":"10.1016\/S0020-0190(03)00233-3_BIB020","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","article-title":"Three partition refinement algorithms","volume":"16","author":"Paige","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(03)00233-3_BIB021","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1145\/321958.321964","article-title":"R-domination in graphs","volume":"23","author":"Slater","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(03)00233-3_BIB022","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(93)90209-R","article-title":"Doubly lexical ordering of dense 0\u20131 matrices","volume":"45","author":"Spinrad","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(03)00233-3_BIB023","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/0138030","article-title":"Edge dominating sets in graphs","volume":"38","author":"Yannakakis","year":"1980","journal-title":"SIAM J. Appl. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002333?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002333?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T15:22:29Z","timestamp":1553181749000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019003002333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0020019003002333"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(03)00233-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}