{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T14:10:37Z","timestamp":1730297437960,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/snpd.2019.8935819","type":"proceedings-article","created":{"date-parts":[[2019,12,19]],"date-time":"2019-12-19T19:36:07Z","timestamp":1576784167000},"page":"78-83","source":"Crossref","is-referenced-by-count":0,"title":["Theoretical analysis of shortest-path congestion unidirectional hypercubes"],"prefix":"10.1109","author":[{"given":"Tzu-Liang","family":"Kung","sequence":"first","affiliation":[{"name":"Asia University, Wufeng,Dept. of Computer Science and Information Engineering,Taichung City,Taiwan,413"}]},{"given":"Lih-Hsing","family":"Hsu","sequence":"additional","affiliation":[{"name":"Providence University, Shalu,Dept. of Computer Science and Information Engineering,Taichung City,Taiwan,433"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SUPERC.1990.130028"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/71.159045"},{"journal-title":"Principles and Practices of Inter-connection Networks","year":"2004","author":"dally","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90030-Y"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90013-Y"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/71.159036"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/71.629487"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2009.132"},{"key":"ref18","first-page":"1155","article-title":"An algorithm for node-to-set disjoint paths problem in rotator graphs","volume":"e84 d","author":"kaneko","year":"2001","journal-title":"IEICE Trans Information and Systems"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.01.004"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/71.824643"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.95"},{"key":"ref6","first-page":"154","volume":"46","author":"cheng","year":"2005","journal-title":"Maximal vertex-connectivity of ?Sn k Networks"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/060674442"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(200003)35:2<139::AID-NET4>3.0.CO;2-E"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00155-6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-010-2455-9"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0030870"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/12.21148"},{"journal-title":"Introduction to Parallel Algorithms and Archi- tectures Arrays Trees Hypercubes","year":"1992","author":"leighton","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2005.113"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265900000081"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2004.02.009"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.57"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3387-7"},{"key":"ref25","first-page":"867","volume":"37","author":"saad","year":"1988","journal-title":"Topological properties of hyper- cubes &#x201D; IEEE Trans Computers"}],"event":{"name":"2019 20th IEEE\/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing (SNPD)","start":{"date-parts":[[2019,7,8]]},"location":"Toyama, Japan","end":{"date-parts":[[2019,7,11]]}},"container-title":["2019 20th IEEE\/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing (SNPD)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8932629\/8935640\/08935819.pdf?arnumber=8935819","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T14:14:33Z","timestamp":1674569673000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8935819\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/snpd.2019.8935819","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}