{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:06Z","timestamp":1725664926349},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540625599"},{"type":"electronic","value":"9783540680727"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62559-3_8","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:41:32Z","timestamp":1330278092000},"page":"73-84","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal parallel routing in star graphs"],"prefix":"10.1007","author":[{"given":"Chi-Chang","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"8_CR1","unstructured":"S. B. Akers, D. Harel, and B. Krishnamurthy, The star graph: an attractive alternative to the n-cube, Proc. Intl. Conf. of Parallel Processing, (1987), pp. 393\u2013400."},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"S. B. Akers","year":"1989","unstructured":"S. B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Trans. on Computers 38, (1989), pp. 555\u2013565.","journal-title":"IEEE Trans. on Computers"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1109\/71.382321","volume":"6","author":"N. Bagherzadeh","year":"1995","unstructured":"N. Bagherzadeh, M. Dowd, and S. Latifi, A well-behaved enumeration of star graphs, IEEE Trans. on Parallel and Distributed Systems 6, (1995), pp. 531\u2013535.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"1398","DOI":"10.1109\/12.247843","volume":"42","author":"N. Bagherzadeh","year":"1993","unstructured":"N. Bagherzadeh, N. Nassif, and S. Latifi, A routing and broadcasting scheme on faulty star graphs, IEEE Trans. on Computers 42, (1993), pp. 1398\u20131403.","journal-title":"IEEE Trans. on Computers"},{"key":"8_CR5","volume-title":"A Survey of Modern Algebra","author":"G. Birkhoff","year":"1965","unstructured":"G. Birkhoff and S. MacLane, A Survey of Modern Algebra, The Macmillan Company, New York, 1965."},{"key":"8_CR6","unstructured":"C. C. Chen, Combinatorial and algebraic methods in star and de Bruijn networks, Ph.D. dissertation, Dept. Computer Science, Texas A&M University, 1995."},{"key":"8_CR7","unstructured":"C. C. Chen and J. Chen, The maximum partition matching problem with applications, Tech. Report 96-001, Dept. Computer Science, Texas A&M University, (1996)."},{"key":"8_CR8","unstructured":"C. C. Chen and J. Chen, Optimal parallel routing in star networks, Tech. Report 96-002, Dept. Computer Science, Texas A&M University, (1996)."},{"key":"8_CR9","unstructured":"C. C. Chen and J. Chen, Nearly optimal one-to-many parallel routing in star networks, Tech. Report 96-003, Dept. Computer Science, Texas A&M University, (1996)."},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/71.262586","volume":"5","author":"K. Day","year":"1994","unstructured":"K. Day and A. Tripathi, A comparative study of topological properties of hypercubes and star graphs, IEEE Trans. Parallel, Distrib. Syst. 5, (1994), pp. 31\u201333.","journal-title":"IEEE Trans. Parallel, Distrib. Syst."},{"key":"8_CR11","unstructured":"M. Dietzfelbinger, S. Madhavapeddy, And I. H. Sudborough, Three disjoint path paradigms in star networks, Proc. 3nd IEEE Symposium on Parallel and Distributed Processing, (1991), pp. 400\u2013406."},{"key":"8_CR12","unstructured":"Z. Galil and X. Yu, Short length versions of Menger's theorem, Proceedings of 27th Annual ACM Symp. on Theory of Computing, (1995), pp. 499\u2013508."},{"key":"8_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979."},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1109\/12.277296","volume":"42","author":"S. W. Graham","year":"1993","unstructured":"S. W. Graham and S. R. Seidel, The cost of broadcasting on star graphs and k-ary hypercubes, IEEE Trans. on Computers 42, (1993), pp. 756\u2013759.","journal-title":"IEEE Trans. on Computers"},{"key":"8_CR15","unstructured":"J. Jwo, S. Lakshmivarahan, and S. K. Dhall, Embedding of cycles and grides in star graphs, Proc. 2nd IEEE Symp. Parallel and Distrib. Processing, (1990), pp. 540\u2013547."},{"key":"8_CR16","unstructured":"J. Jwo, S. Lakshmivarahan, and S. K. Dhall, Characterization of node disjoint (parallel) path in star graphs, Proc. 5th Intl. Parallel Processing Symp., (1991), pp. 404\u2013409."},{"key":"8_CR17","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K. Menger","year":"1927","unstructured":"K. Menger, Zur allgemeinen kurventheorie, Fund. Math. 10, (1927), pp. 96\u2013115.","journal-title":"Fund. Math."},{"key":"8_CR18","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/12.250605","volume":"43","author":"Z. Miller","year":"1994","unstructured":"Z. Miller, D. Pritikin, and I. H. Sudborough, Near embeddings of hypercubes into Cayley graphs on the symmetric group, IEEE Trans. on Computers 43, (1994), pp. 13\u201322.","journal-title":"IEEE Trans. on Computers"},{"key":"8_CR19","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1006\/jpdc.1994.1082","volume":"22","author":"J. Misic","year":"1994","unstructured":"J. Misic and Z. Jovanovic, Routing function and deadlock avoidance in a star graph interconnection network, J. Parallel and Distrib. Computing 22, (1994), pp. 216\u2013228.","journal-title":"J. Parallel and Distrib. Computing"},{"key":"8_CR20","unstructured":"M. Nigam, S. Sahni, and B. Krishnamurthy, Embedding hamiltonians and hypercubes in star interconnection graphs, Proc. Intl. Conf. of Parallel Processing, (1990), pp. 340\u2013343."},{"key":"8_CR21","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1006\/jpdc.1994.1015","volume":"20","author":"M. A. Palis","year":"1994","unstructured":"M. A. Palis and S. Rajasekaran, Packet routing and PRAM emulation on star graphs and leveled networks, J. Parallel and Distrib. Comput. 20, (1994), pp. 145\u2013157.","journal-title":"J. Parallel and Distrib. Comput."},{"key":"8_CR22","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1006\/jpdc.1994.1066","volume":"22","author":"K. Qiu","year":"1994","unstructured":"K. Qiu, S. G. Akl, and H. Meijer, On some properties and algorithms for the star and pancake interconnection networks, J. Parallel and Distrib. Comput. 22, (1994), pp. 16\u201325.","journal-title":"J. Parallel and Distrib. Comput."},{"key":"8_CR23","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1109\/71.388046","volume":"6","author":"J Sheu","year":"1995","unstructured":"J Sheu, C. Wu, and T. Chen, An optimal broadcasting algorithm without message redundancy in star graphs, IEEE Trans. Parallel, Distrib. Syst. 6, (1995), pp. 653\u2013658.","journal-title":"IEEE Trans. Parallel, Distrib. Syst."},{"key":"8_CR24","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0898-1221(93)90188-2","volume":"25","author":"S. Sur","year":"1993","unstructured":"S. Sur and P. K. Srimani, Topological properties of star graphs, Computers Math. Applic. 25, (1993), pp. 87\u201398.","journal-title":"Computers Math. Applic."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62559-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:29:38Z","timestamp":1578508178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62559-3_8"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540625599","9783540680727"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-62559-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}