{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T22:37:47Z","timestamp":1769726267334,"version":"3.49.0"},"reference-count":30,"publisher":"Informa UK Limited","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1080\/00207160701619200","type":"journal-article","created":{"date-parts":[[2008,6,21]],"date-time":"2008-06-21T12:17:07Z","timestamp":1214050627000},"page":"1771-1778","source":"Crossref","is-referenced-by-count":24,"title":["Largest connected component of a star graph with faulty vertices"],"prefix":"10.1080","volume":"85","author":[{"given":"Xiaofan","family":"Yang","sequence":"first","affiliation":[]},{"given":"Graham M.","family":"Megson","sequence":"additional","affiliation":[]},{"given":"Yuan Yan","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Yongkang","family":"Xing","sequence":"additional","affiliation":[]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1109\/12.21148"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230230403"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1109\/71.605767"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-7315(02)00056-4"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000089"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-7315(03)00031-5"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265901000336"},{"key":"CIT0008","doi-asserted-by":"crossref","unstructured":"Day, K. and Al-Ayyoub, A.E. 2002. Reliable communication in faulty star networks. International Parallel and Distributed Processing Symposium: IPDPS 2002 Workshops. 2002, Marriott Marina, Fort Lauderdale, Florida, USA. pp.0260b","DOI":"10.1109\/IPDPS.2002.1016687"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1109\/12.42131"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1109\/71.282562"},{"key":"CIT0011","doi-asserted-by":"crossref","unstructured":"Fragopoulou, P. and Akl, S. G. Fault tolerant communication algorithms on the star network using disjoint paths. 28th Annual Hawaii International Conference on System Sciences. Kihei, Maui, Hawaii, USA. Vol. 2, pp.4\u201313.","DOI":"10.1109\/HICSS.1995.375483"},{"key":"CIT0012","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"Harary F.","year":"1969"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00190-0"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1109\/12.954510"},{"key":"CIT0015","first-page":"21","volume":"99","author":"Latifi S.","year":"1997","journal-title":"Inf. Comp. Sci."},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7906(96)00032-8"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2004.06.135"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(96)00165-2"},{"key":"CIT0019","volume-title":"An Introduction to Parallel Processing: Algorithms and Architectures","author":"Parhami B.","year":"1999"},{"key":"CIT0020","unstructured":"Qiu, K. and Akl, S. G. On vertex-to-vertex disjoint paths in the star interconnection network. International Conference on Parallel and Distributed Computing Systems, PDCS 2005. Phoenix, AZ, USA. pp.731\u2013735."},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.1297"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1993.1098"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1109\/71.707542"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2001.1812"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1109\/71.242151"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1109\/71.640010"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.10.002"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1080\/00207160410001661726"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1080\/0020716041233127208"},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1080\/00207160500113173"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160701619200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T20:28:02Z","timestamp":1738268882000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207160701619200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":30,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["10.1080\/00207160701619200"],"URL":"https:\/\/doi.org\/10.1080\/00207160701619200","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12]]}}}