{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T21:46:57Z","timestamp":1648676817489},"reference-count":6,"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> In a previous paper we solved an open problem named as the three disjoint path problem on honeycomb meshes. In this paper we extend the technique used to solve the related problem on honeycomb tori. The result gives the minimum possible length of the longest of any three disjoint paths between two given nodes in a torus. The problem has practical benefits in the fault tolerant aspects of interconnection topologies. <\/jats:p>","DOI":"10.1142\/s0129626404001994","type":"journal-article","created":{"date-parts":[[2005,5,24]],"date-time":"2005-05-24T07:56:24Z","timestamp":1116921384000},"page":"411-422","source":"Crossref","is-referenced-by-count":6,"title":["A SOLUTION TO THE THREE DISJOINT PATH PROBLEM ON HONEYCOMB TORI"],"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":"MENGSON","sequence":"additional","affiliation":[{"name":"Department of Computer Science,  University of Reading, P O Box 225, Whiteknights, Reading, Berkshire, RG6 6AY, UK"}]},{"given":"SHAOMIN","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":"Introduction 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"},{"key":"rf6","volume":"14","author":"Yang X.","journal-title":"Parallel Processing Letters"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626404001994","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T09:38:39Z","timestamp":1565170719000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626404001994"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":6,"journal-issue":{"issue":"03n04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2004,9]]}},"alternative-id":["10.1142\/S0129626404001994"],"URL":"https:\/\/doi.org\/10.1142\/s0129626404001994","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}