{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:28:18Z","timestamp":1742383698774,"version":"3.38.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1109\/tpds.2002.1036071","type":"journal-article","created":{"date-parts":[[2002,10,18]],"date-time":"2002-10-18T21:39:07Z","timestamp":1034977147000},"page":"985-993","source":"Crossref","is-referenced-by-count":5,"title":["An efficient parallel algorithm for the efficient domination problem on distance-hereditary graphs"],"prefix":"10.1109","volume":"13","author":[{"family":"Sun-yuan Hsieh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(89)90017-5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90043-2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)00052-K"},{"key":"ref4","article-title":"Disjoint Dominating Sets in Trees","volume-title":"Sandia Laboratories Report, SAND 78-1087J","author":"Bange","year":"1978"},{"key":"ref5","first-page":"189","article-title":"Efficient Dominating Sets in Graphs","volume-title":"Application of Discrete Math","author":"Bange","year":"1988"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(73)90042-7"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/(sici)1097-0037(199805)31:3<177::aid-net4>3.3.co;2-a"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90147-2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00067-3"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63890-3_37"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045090"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/0217032"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58218-5_34"},{"key":"ref14","first-page":"213","article-title":"Distance-Hereditary Graphs and Multidestination Message-Routing in Multicomputers","volume":"13","author":"Esfahanian","year":"1993","journal-title":"J. Combinatorial Math. and Combinatorial Computing"},{"volume-title":"Algorithmic Graph Theory and Perfect Graphs","year":"1980","author":"Golumbic","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90131-U"},{"key":"ref17","first-page":"777","article-title":"Efficient Parallel Algorithms for Solving Some Tree Problems","volume-title":"Proc. 24th Allerton Conf. Communication, Control, and Computing","author":"He"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90012-N"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90007-7"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/28.4.417"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626499000074"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49164-3_40"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1064"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49381-6_28"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"ref26","first-page":"187","article-title":"Perfect Dominating Sets","volume":"79","author":"Livingston","year":"1990","journal-title":"Congressus Numerantium"},{"article-title":"Efficient Domination on Bipartite Graphs","year":"1996","author":"Lu","key":"ref27"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90100-N"},{"article-title":"Hamiltonian Problems on Distance-Hereditary Graphs","year":"1994","author":"Nicolai","key":"ref29"},{"key":"ref30","first-page":"219","article-title":"Computing the Average Distance of a Distance-Hereditary Graph in Linear Time","volume":"103","author":"Oellermann","year":"1994","journal-title":"Congressus Numerantium"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0166-218X(98)00060-2","article-title":"Weighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs","volume":"87","author":"Yeh","year":"1998","journal-title":"Discrete Applied Math"},{"key":"ref32","article-title":"Algorithmic Aspects of Perfect Domination","volume-title":"Department of Computer Science","author":"Yen","year":"1992"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0166-218X(94)00138-4","article-title":"The Weighted Perfect Domination Problem and Its Variants","volume":"66","author":"Yen","year":"1996","journal-title":"Discrete Applied Math"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/71\/22233\/01036071.pdf?arnumber=1036071","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T05:28:27Z","timestamp":1742016507000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1036071\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":33,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2002,9]]}},"URL":"https:\/\/doi.org\/10.1109\/tpds.2002.1036071","relation":{},"ISSN":["1045-9219"],"issn-type":[{"type":"print","value":"1045-9219"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}