{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T05:59:30Z","timestamp":1648879170355},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"03n04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2004,9]]},"abstract":"<jats:p> Recently honeycomb meshes have been considered as alternative candidates for interconnection networks in parallel and distributed computer systems. This paper presents a solution to one of the open problems about honeycomb meshes\u2014the so-called three disjoint path problem. The problem requires minimizing the length of the longest of any three disjoint paths between 3-degree nodes. This solution provides information on the re-routing of traffic along the network in the presence of faults. <\/jats:p>","DOI":"10.1142\/s0129626404001982","type":"journal-article","created":{"date-parts":[[2005,5,24]],"date-time":"2005-05-24T11:56:24Z","timestamp":1116935784000},"page":"399-410","source":"Crossref","is-referenced-by-count":7,"title":["A SOLUTION TO THE THREE DISJOINT PATH PROBLEM ON HONEYCOMB MESHES"],"prefix":"10.1142","volume":"14","author":[{"given":"XIAOFAN","family":"YANG","sequence":"first","affiliation":[{"name":"Department of Computer Science,  Chongqing University, Chongqing, 430044, China"}]},{"given":"GRAHAM M.","family":"MEGSON","sequence":"additional","affiliation":[{"name":"Department of Computer Science,  University of Reading, P O Box 225, Whiteknights, Reading, Berkshire, RG6 6AY, UK"}]},{"given":"SHAOMlN","family":"ZHANG","sequence":"additional","affiliation":[{"name":"Department of Computer Science,  Shenyang Institute of Technology, Shenyang, China"}]},{"given":"XIAOPING","family":"LIU","sequence":"additional","affiliation":[{"name":"Institute of Multimedia Network and  Telecommunication Engineering, Wuhan Technological University of  Surveying and Mapping, Wuhan, 430079, China"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","volume-title":"Introducing to Parallel Computing: Design and Analysis of Algorithms","author":"Kumar V.","year":"1994"},{"key":"rf2","volume-title":"The Design and Analysis of Parallel Algorithms","author":"Akl S. G.","year":"1989"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1987.1663541"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1109\/5.48829"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1109\/71.629486"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626404001982","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:38:37Z","timestamp":1565185117000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626404001982"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":5,"journal-issue":{"issue":"03n04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2004,9]]}},"alternative-id":["10.1142\/S0129626404001982"],"URL":"https:\/\/doi.org\/10.1142\/s0129626404001982","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}