{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:03:07Z","timestamp":1730275387782,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/ispan.2004.1300538","type":"proceedings-article","created":{"date-parts":[[2004,6,10]],"date-time":"2004-06-10T14:19:45Z","timestamp":1086877185000},"page":"563-568","source":"Crossref","is-referenced-by-count":1,"title":["Container problem in substring reversal graphs"],"prefix":"10.1109","author":[{"given":"Y.","family":"Suzuki","sequence":"first","affiliation":[]},{"given":"K.","family":"Kaneko","sequence":"additional","affiliation":[]},{"given":"M.","family":"Nakamori","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/2465.2467"},{"key":"18","first-page":"610","article-title":"An algorithm for node-disjoint paths in pancake graphs","volume":"e86 d","author":"suzuki","year":"2003","journal-title":"IEICE Trans Information and Systems"},{"key":"15","first-page":"360","article-title":"Parallel routing and sorting on the pancake network","author":"qiu","year":"1991","journal-title":"Proc Int'l Conf Computing and Information"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/62044.62050"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1093\/ietisy\/e89-d.2.647"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/SPDP.1990.143599"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00059-8"},{"key":"12","first-page":"477","article-title":"Non-adaptive fault-tolerant file transmission in rotator graphs","volume":"e79 a","author":"hamada","year":"1996","journal-title":"IEICE Trans Fundamentals"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(93)90107-V"},{"key":"2","first-page":"565","article-title":"Parallel minimum spanning forest algorithms on the star and pancake interconnection networks","author":"akl","year":"1992","journal-title":"Proc of Joint Conf Vector and Parallel Processing"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/12.21148"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(79)90068-2"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/SPDP.1991.218213"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/71.159045"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/71.553290"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230230403"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.1995.375503"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90043-9"}],"event":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","start":{"date-parts":[[2004,5,12]]},"location":"Hong Kong, China","end":{"date-parts":[[2004,5,12]]}},"container-title":["7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9103\/28881\/01300538.pdf?arnumber=1300538","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T00:33:22Z","timestamp":1489451602000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1300538\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/ispan.2004.1300538","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}