{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:04:03Z","timestamp":1725480243656},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405054"},{"type":"electronic","value":"9783540450665"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45066-1_15","type":"book-chapter","created":{"date-parts":[[2007,2,28]],"date-time":"2007-02-28T12:41:13Z","timestamp":1172666473000},"page":"193-202","source":"Crossref","is-referenced-by-count":1,"title":["Paths Coloring Algorithms in Mesh Networks"],"prefix":"10.1007","author":[{"given":"Mustapha","family":"Kchikech","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Togni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"15_CR1","unstructured":"Aggarwal A, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, and M. Sudan. Efficient routing and scheduling algorithms for optical networks. In Daniel D. Sleator, editor, Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 412\u2013423. ACM Press, 1994."},{"issue":"1\u20133","key":"15_CR2","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/S0012-365X(00)00289-2","volume":"235","author":"D. Amar","year":"2001","unstructured":"D. Amar, A. Raspaud, and O. Togni. All-to-all wavelength-routing in all-optical compound networks. Discrete Math., 235(1\u20133):353\u2013363, 2001. Combinatorics (Prague, 1998).","journal-title":"Discrete Math."},{"key":"15_CR3","unstructured":"B. Beauquier, J-C. Bermond, L. Gargano, P. Hell, S. Perennes, and U. Vaccaro. Graphs problems arising from wavelength-routing in all-optical networks. In Proc. WOCS\u201997, 1997."},{"key":"15_CR4","unstructured":"T. Erlebach and K. Jansen. Call scheduling in trees, rings and meshes. In HICSS: Hawaii International Conference on System Sciences. IEEE Computer Society Press, 1997."},{"key":"15_CR5","unstructured":"T. Erlebach and K. Jansen. Scheduling of virtual connections in fast networks. In Proc. of the 4th Workshop on Parallel Systems and Algorithms PASA 96, 1996, pp. 13\u201332."},{"issue":"1\u20132","key":"15_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(99)00152-8","volume":"255","author":"T. Erlebach","year":"2001","unstructured":"Thomas Erlebach and Klaus Jansen. The complexity of path coloring and call scheduling. Theoret. Comput. Sci., 255(1\u20132):33\u201350, 2001.","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"C. Kaklamanis, P. Persiano, T. Erlebach, and K. Jansen. Constrained bipartite edge coloring with application to wavelength routing. In Proc. of ICALP 1997.","DOI":"10.1007\/3-540-63165-8_205"},{"key":"15_CR8","unstructured":"L. Narayanan, J. Opatrny, and D. Sotteau. All-to-all optical routing in optimal chordal networks of degree 4. In Proc. SODA\u201999. 1998."},{"key":"15_CR9","unstructured":"J. Palaysi. Routage optique et coloration des chemins dans un r\u00e9seaux torique toutoptique. In Proc. 2me Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9l\u00e9ecommunications (Algotel 2000), pages 77\u201382. INRIA, 2000."},{"key":"15_CR10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/978-3-0348-8211-8_13","volume-title":"Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and Probabilities","author":"J. Palaysi","year":"2002","unstructured":"J. Palaysi. Approximability of paths coloring problem in mesh and torus networks. Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and Probabilities, pages 213\u2013222. Trends in Mathematics. Versailles-Saint-Quentin, France. September 2002."},{"key":"15_CR11","first-page":"400","volume-title":"37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996)","author":"Y. Rabani","year":"1996","unstructured":"Yuval Rabani. Path coloring on the mesh. In 37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996), pages 400\u2013409. IEEE Comput. Soc. Press, Los Alamitos, CA, 1996."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"P. Raghavan, E. Upfal. Efficient routing in all-optical networks. In Proc. of STOC 1994.","DOI":"10.1145\/195058.195119"},{"key":"15_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/3-540-63774-5_138","volume-title":"Optical all-to-all communication for some product graphs","author":"H. Schroeder","year":"1997","unstructured":"H. Schroeder, O. Sykora, and I. Vrt\u2019o. Optical all-to-all communication for some product graphs. Lecture Notes in Computer Science, 1338:555\u2013562, 1997. In Proc. of SOFSEM\u201997."}],"container-title":["Lecture Notes in Computer Science","Discrete Mathematics and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45066-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T00:18:57Z","timestamp":1556151537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45066-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405054","9783540450665"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45066-1_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}