{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:01:46Z","timestamp":1725483706280},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678236"},{"type":"electronic","value":"9783540449294"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44929-9_6","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:20:53Z","timestamp":1178356853000},"page":"76-83","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Edge Coloring of a Tree on a Mesh Connected Computer"],"prefix":"10.1007","author":[{"given":"Chang -Sung","family":"Jeong","sequence":"first","affiliation":[]},{"given":"Sung-Up","family":"Cho","sequence":"additional","affiliation":[]},{"given":"Sun-Chul","family":"Whang","sequence":"additional","affiliation":[]},{"given":"Mi-Young","family":"Choi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1109\/TC.1979.1675280","volume":"28","author":"H. J. Siegel","year":"1979","unstructured":"H. J. Siegel, A Model of SIMD Machines and a Comparison of Various Interconnection Networks, IEEE Trans. Comput. 28 (1979) 907\u2013917.","journal-title":"IEEE Trans. Comput."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"C. S. Jeong, and D. T. Lee, Parallel Geometric Algorithms on a Mesh-Connected Computer, Algorithmica 5 (1990) 155\u2013177.","DOI":"10.1007\/BF01840383"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"C. D. Thompson, and H. T. Kung, Sorting on a Mesh-Connected Parallel Computer, Comm. ACM 20 (1977) 263\u2013271.","DOI":"10.1145\/359461.359481"},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1080\/01495739708941425","volume":"12","author":"N. Folwell","year":"1997","unstructured":"N. Folwell, S. Guha and I. Suzuki, A Practical Algorithm for Integer Sorting on a Mesh-Connected Computer, Parallel Algorithms and Applicationsi 12 (1997) 265\u2013278.","journal-title":"Parallel Algorithms and Applicationsi"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"M. M. Atallah, and S. E. Hambrusch, Solving Tree Problems on a Mesh-Connected Processor Array, Proc. 26th IEEE FOCS Conference (1985) 222\u2013231.","DOI":"10.1109\/SFCS.1985.53"},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/10637199508915473","volume":"5","author":"M. H. Kim","year":"1995","unstructured":"M. H. Kim, and C. S. Jeong, An Optimal Parallel Matching Algorithm for a Convex Bipartite Graph on a Mesh-Connected Computer, Parallel Algorithms and Applications 5 (1995) 15\u201335.","journal-title":"Parallel Algorithms and Applications"},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1109\/71.706053","volume":"9","author":"B. Murthy","year":"1998","unstructured":"B. Murthy, K. Bhuvaneswari, and C. S. Murthy, A New Algorithm based on Givens Rotations Solving Linear Equations on Fault-Tolerant Mesh-Connected Processors, IEEE Trans. on Parallel and Distributed Systems 9 (1998) 825\u2013832.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"D. Nassimi, and S. Sahni, Data Broadcasting in SIMD Computers, IEEE Trans, on Comput. (1981) 101\u2013106.","DOI":"10.1109\/TC.1981.6312172"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"J. A. Bondy, and U. S. R. Murty, Graph Theory with Applications, American Elsevier (1977).","DOI":"10.1007\/978-1-349-03521-2"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1137\/0211043","volume":"11","author":"R. Cole","year":"1982","unstructured":"R. Cole, and J. Hopcroft, On Edge Coloring Bipartite Graphs, SIAM J. Comput. 11 (1982) 540\u2013546.","journal-title":"SIAM J. Comput."},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"H. Gabow, Using Euler Partitions to Edge Color Bipartite Multigraphs, Inter. J. Comp. and Inf. Scie. 5 (1976) 345\u2013355.","DOI":"10.1007\/BF00998632"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1137\/0211009","volume":"11","author":"H. Gabow","year":"1982","unstructured":"H. Gabow, and O. Kariv, Algorithms for Edge Coloring Bipartite Multigraphs, SIAM J. Comput. 11 (1982) 117\u2013129.","journal-title":"SIAM J. Comput."},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TC.1981.6312171","volume":"30","author":"G. Lev","year":"1981","unstructured":"G. Lev, N. Pippenger, and L. G. Valiant, A Fast Parallel Algorithm for Routing in Permutation Networks, IEEE Trans. Comput. 30 (1981) 93\u2013110.","journal-title":"IEEE Trans. Comput."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"S. Mitchell, and S. Hedetniemi, Linear Algorithms for Edge coloring Trees and Unicyclic Graphs, Info. Proc. Lett 9 (1979) 110\u2013112.","DOI":"10.1016\/0020-0190(79)90049-8"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44929-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:40:54Z","timestamp":1556376054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44929-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678236","9783540449294"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44929-9_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}