{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T08:09:38Z","timestamp":1750147778613,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584308"},{"type":"electronic","value":"9783540487890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58430-7_65","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:05:56Z","timestamp":1330272356000},"page":"749-760","source":"Crossref","is-referenced-by-count":4,"title":["Asymptotically optimal communication algorithms on faulty folded petersen networks"],"prefix":"10.1007","author":[{"given":"Sabine R.","family":"\u00d6hring","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sajal K.","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk H.","family":"Hohndel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"65_CR1","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0743-7315(91)90033-6","volume":"11","author":"D.P. Bertsekas","year":"1991","unstructured":"D.P. Bertsekas, C. \u00d6zveren, G.D. Stamoulis, P. Tseng, and J.N. Tsitsiklis. Optimal communication algorithms for hypercubes. Journal of Parallel and Distributed Computing, 11:263\u2013275, 1991.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"65_CR2","unstructured":"G. Chartrand and R.J. Wilson. The Petersen graph. Graphs and Applications (Eds. F. Harary and J.S. Maybee), pages 69\u2013100, 1985."},{"key":"65_CR3","doi-asserted-by":"crossref","unstructured":"P. Fragopoulou and S.G. Akl. Optimal communication algorithms on the star interconnection network. In Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, Dallas, TX, pages 702\u2013711, December 1993.","DOI":"10.1109\/SPDP.1993.395464"},{"key":"65_CR4","first-page":"225","volume":"I","author":"P. Fraigniaud","year":"1991","unstructured":"P. Fraigniaud and C.T. Ho. Arc disjoint spanning trees on cube connected cycles network. In Proceedings of the International Conference on Parallel Processing, St. Charles, vol. I, pages 225\u2013229, 1991.","journal-title":"Proceedings of the International Conference on Parallel Processing, St. Charles"},{"issue":"9","key":"65_CR5","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1109\/71.243525","volume":"4","author":"E. Ganesan","year":"1993","unstructured":"E. Ganesan and D.K. Pradhan. The hyper-de Bruijn networks: Scalable versatile architecture. IEEE Transactions on Parallel and Distributed Systems, 4(9):962\u2013978, 1993.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"9","key":"65_CR6","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","volume":"38","author":"S.L. Johnsson","year":"1989","unstructured":"S.L. Johnsson and C.-T. Ho. Optimum broadcasting and personalized communication in hypercubes. IEEE Transaction on Computers, 38(9):1249\u20131268, September 1989.","journal-title":"IEEE Transaction on Computers"},{"key":"65_CR7","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes","author":"F.T. Leighton","year":"1992","unstructured":"F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes. Morgan Kaufmann Publishers, San Mateo, CA, 1992."},{"key":"65_CR8","doi-asserted-by":"crossref","unstructured":"S. \u00d6hring and S.K. Das. The folded Petersen cube networks: New competitors for the hypercube. In Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Computing, Dallas, TX, pages 582\u2013589, December 1993.","DOI":"10.1109\/SPDP.1993.395482"},{"key":"65_CR9","doi-asserted-by":"crossref","unstructured":"S. \u00d6hring and S.K. Das. Efficient Communication on the Folded Petersen Interconnection Networks. In Proceedings of Parallel Architectures and Languages Europe 1994, Athens, Greece, to appear in Lecture Notes in Computer Science, July 1994.","DOI":"10.1007\/3-540-58184-7_87"},{"key":"65_CR10","unstructured":"S. \u00d6hring and D.H. Hohndel. Optimal fault tolerant communication algorithms on product networks using spanning trees. Tech. Report CRPDC-94-11, University of North Texas, June 1994."},{"key":"65_CR11","doi-asserted-by":"crossref","unstructured":"S. \u00d6hring, D.H. Hohndel, and S.K. Das. Fault tolerant communication algorithms on the folded petersen networks based on arc-disjoint spanning trees. Technical Report CRPDC-94-4, University of Wuerzburg, University of North Texas, February 1994.","DOI":"10.1007\/3-540-58430-7_65"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing: CONPAR 94 \u2014 VAPP VI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58430-7_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:29:08Z","timestamp":1742596148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58430-7_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584308","9783540487890"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-58430-7_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}