{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:51:42Z","timestamp":1762210302172},"reference-count":21,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"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":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0743-7315(03)00040-6","type":"journal-article","created":{"date-parts":[[2003,6,21]],"date-time":"2003-06-21T02:57:13Z","timestamp":1056164233000},"page":"481-487","source":"Crossref","is-referenced-by-count":14,"title":["Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars"],"prefix":"10.1016","volume":"63","author":[{"given":"Fu-Hsing","family":"Wang","sequence":"first","affiliation":[]},{"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Yue-Li","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Sun-Jen","family":"Huang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0743-7315(03)00040-6_BIB1","unstructured":"S.B. Akers, D. Harel, B. Kirshnamurthy, The star graph: an attractive alternative to the n-cube, in: Proceedings of the International Conference on Parallel Processing, St. Charles, IL, 1987, pp. 393\u2013400."},{"issue":"4","key":"10.1016\/S0743-7315(03)00040-6_BIB2","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","article-title":"A group-theoretic model for symmetric interconnection networks","volume":"38","author":"Akers","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0743-7315(03)00040-6_BIB3","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1006\/jagm.1993.1047","article-title":"How to allocate network centers","volume":"15","author":"Bar-Ilan","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0743-7315(03)00040-6_BIB4","first-page":"47","article-title":"Fault tolerant routing in split-stars and alternating group graphs","volume":"137","author":"Cheng","year":"1999","journal-title":"Congressus Numer."},{"key":"10.1016\/S0743-7315(03)00040-6_BIB5","first-page":"21","article-title":"Disjoint paths in split-stars","volume":"139","author":"Cheng","year":"1999","journal-title":"Congressus Numer."},{"key":"10.1016\/S0743-7315(03)00040-6_BIB6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/(SICI)1097-0037(200003)35:2<139::AID-NET4>3.0.CO;2-E","article-title":"Orienting split-stars and alternating group graphs","volume":"35","author":"Cheng","year":"2000","journal-title":"Networks"},{"key":"10.1016\/S0743-7315(03)00040-6_BIB7","first-page":"97","article-title":"Increasing the connectivity of split-stars","volume":"146","author":"Cheng","year":"2000","journal-title":"Congressus Numer."},{"key":"10.1016\/S0743-7315(03)00040-6_BIB8","series-title":"An attractive variation of the star graphs: split-stars, Technical Report No. 98-3","author":"Cheng","year":"1998"},{"key":"10.1016\/S0743-7315(03)00040-6_BIB9","first-page":"107","article-title":"Super connectivity of star graphs and split-stars","volume":"52","author":"Cheng","year":"2001","journal-title":"Ars Combin."},{"key":"10.1016\/S0743-7315(03)00040-6_BIB10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/71.262586","article-title":"A comparative study of topological properties of hypercubes and star graphs","volume":"5","author":"Day","year":"1994","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"key":"10.1016\/S0743-7315(03)00040-6_BIB11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(90)90348-L","article-title":"The bondage number of a graph","volume":"86","author":"Fink","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0743-7315(03)00040-6_BIB12","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0743-7315(03)00040-6_BIB13","series-title":"Fundamentals of Domination in Graphs","author":"Haynes","year":"1998"},{"key":"10.1016\/S0743-7315(03)00040-6_BIB14","series-title":"Domination in Graphs: Advanced Topics","author":"Haynes","year":"1998"},{"key":"10.1016\/S0743-7315(03)00040-6_BIB15","series-title":"Digraphs: Theory, Algorithms and Applications","author":"Jensen","year":"2001"},{"key":"10.1016\/S0743-7315(03)00040-6_BIB16","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s00446-002-0078-0","article-title":"An efficient distributed algorithm for constructing small dominating sets","volume":"15","author":"Jia","year":"2002","journal-title":"Distrib. Comput."},{"key":"10.1016\/S0743-7315(03)00040-6_BIB17","doi-asserted-by":"crossref","unstructured":"B. Liang, Z. Haas, Virtual backbone generation and maintenance in ad hoc network mobility management, in: Proceedings of the 2000 IEEE INFOCOM, Tel Aviv, Israel, March 2000.","DOI":"10.1109\/INFCOM.2000.832522"},{"key":"10.1016\/S0743-7315(03)00040-6_BIB18","doi-asserted-by":"crossref","unstructured":"D. Peleg, Distributed data structures: a complexity oriented view, in: Proceedings of the Fourth International Workshop on Distributed Algorithms, Bari, Italy, 1990, pp. 71\u201389.","DOI":"10.1007\/3-540-54099-7_6"},{"key":"10.1016\/S0743-7315(03)00040-6_BIB19","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\/S0743-7315(03)00040-6_BIB20","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0012-365X(96)00007-6","article-title":"New results about the bondage number of a graph","volume":"171","author":"Teschner","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0743-7315(03)00040-6_BIB21","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0012-365X(96)00347-0","article-title":"On the bondage number of a graph","volume":"159","author":"Wang","year":"1996","journal-title":"Discrete Math."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731503000406?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731503000406?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,22]],"date-time":"2020-03-22T17:06:32Z","timestamp":1584896792000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731503000406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0743731503000406"],"URL":"https:\/\/doi.org\/10.1016\/s0743-7315(03)00040-6","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}