{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T21:27:30Z","timestamp":1790112450532,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540631651","type":"print"},{"value":"9783540691945","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63165-8_206","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:11:35Z","timestamp":1330279895000},"page":"505-515","source":"Crossref","is-referenced-by-count":23,"title":["Colouring paths in directed symmetric trees with applications to WDM routing"],"prefix":"10.1007","author":[{"given":"Luisa","family":"Gargano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pavol","family":"Hell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephane","family":"Perennes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"48_CR1","unstructured":"A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, M. Sudan. \u201cEfficient Routing and Scheduling Algorithms for Optical Networks\u201d, in Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'94), (1994), 412\u2013423."},{"key":"48_CR2","unstructured":"Y. Aumann and Y. Rabani. \u201cImproved Bounds for All Optical Routing\u201d, Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'95), (1995), 567\u2013576."},{"key":"48_CR3","first-page":"431","volume":"1136","author":"B. Awerbuch","year":"1996","unstructured":"B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi, and A. Rosen, \u201cOn-Line Competitive Algorithms for Call Admission in Optical Networks\u201d, Proceedings of ES A '96, LNCS 1136, (1996), 431\u2013444.","journal-title":"LNCS"},{"key":"48_CR4","unstructured":"R. A. Barry and P. A. Humblet, \u201cOn the Number of Wavelengths and Switches in All-Optical Networks\u201d, in IEEE Transactions on Communications, (1993)."},{"key":"48_CR5","unstructured":"B. Beauquier. \u201cAll-to-All Communication for some Wavelength-Routing All-Optical Networks\u201d, Manuscript, (1996)."},{"key":"48_CR6","unstructured":"B. Beauquier, J-C. Bermond, L. Gargano, P. Hell, S. Perennes, and U. Vaccaro, \u201cGraph Problems arising from Wavelength-Routing in All-Optical Networks\u201d, 2nd Workshop on Optics and Computer Science (WOCS), April 1997, Geneva, CH."},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"J-C. Bermond, L. Gargano, S. Perennes, A. Rescigno and U. Vaccaro. \u201cEfficient Collective Communications in Optical Networks\u201d, Proc. 23nd ICALP'96, Paderborn, Germany, (1996).","DOI":"10.1007\/3-540-61440-0_160"},{"key":"48_CR8","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"D. P. Bertsekas","year":"1989","unstructured":"D. P. Bertsekas, and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, NJ, 1989."},{"key":"48_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory and Applications","author":"J.A. Bondy","year":"1976","unstructured":"J.A. Bondy and U.S.R. Murty, \u201cGraph Theory and Applications\u201d, American Elsevier, N.Y. 1976."},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"N.K. Cheung, K. Nosu and G. Winzer. IEEE JSAC: Special Issue on Dense WDM Networks, vol. 8 (1990).","DOI":"10.1109\/49.57828"},{"key":"48_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1137\/1037042","volume":"37","author":"J. J. Dongarra","year":"1995","unstructured":"J. J. Dongarra and D. W. Walker, \u201cSoftware Libraries for Linear Algebra Computation on High Performances Computers\u201d, SIAM Review, vol. 37, (1995), 151\u2013180.","journal-title":"SIAM Review"},{"key":"48_CR12","unstructured":"T. Erlebach and K. Jansen. \u201cScheduling of Virtual Connections in Fast Networks\u201d, Proc. of 4th Workshop on Parallel Systems and Algorithms PASA '96, (1996), 13\u201332."},{"key":"48_CR13","volume-title":"Solving Problems on Concurrent Processors, Volume I","author":"G. Fox","year":"1988","unstructured":"G. Fox, M. Johnsson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker, Solving Problems on Concurrent Processors, Volume I, Prentice Hall, Englewood Cliffs, NJ, 1988."},{"key":"48_CR14","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M. C. Golumbic, \u201cAlgorithmic Graph Theory and Perfect Graphs\u201d, Academic Press, N.Y. 1980."},{"key":"48_CR15","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0095-8956(85)90088-7","volume":"B 38","author":"M. C. Golumbic","year":"1985","unstructured":"M. C. Golumbic and R. E. Jamison, The edge intersection grpahs of paths in a tree, J. Combinatorial Theory B 38 (1985) 8\u201322.","journal-title":"J. Combinatorial Theory"},{"key":"48_CR16","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/2.84902","volume":"24","author":"P. E. Green","year":"1991","unstructured":"P. E. Green. \u201cThe Future of Fiber-Optic Computer Networks\u201d, IEEE Computer, vol. 24, (1991), 78\u201387.","journal-title":"IEEE Computer"},{"key":"48_CR17","unstructured":"P. E. Green. Fiber-Optic Communication Networks, Prentice-Hall, 1992."},{"key":"48_CR18","doi-asserted-by":"crossref","unstructured":"C. Kaklamanis and P. Persiano, \u201cEfficient Wavelength Routing on Directed Fiber Trees\u201d, Proc. ESA'96, Springer Verlag, LNCS 1136, (1996), 460\u2013470.","DOI":"10.1007\/3-540-61680-2_75"},{"key":"48_CR19","doi-asserted-by":"crossref","unstructured":"C. Kaklamanis and P. Persiano. \u201cConstrained Bipartite Edge Coloring with Applications to Wavelength Routing\u201d, Manuscript (1996).","DOI":"10.1007\/3-540-63165-8_205"},{"key":"48_CR20","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230180406","volume":"18","author":"S. M. Hedetniemi","year":"1988","unstructured":"S. M. Hedetniemi, S. T. Hedetniemi, and A. Liestman, \u201cA Survey of Gossiping and Broadcasting in Communication Networks\u201d, NETWORKS, 18 (1988), 129\u2013134.","journal-title":"NETWORKS"},{"key":"48_CR21","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, R. Klasing, B. Monien, and R. Peine, \u201cDissemination of Information in Interconnection Networks (Broadcasting and Gossiping)\u201d, in: Ding-Zhu Du and D. Frank Hsu (Eds.) Combinatorial Network Theory, Kluwer Academic Publishers, 1995, pp. 125\u2013212.","DOI":"10.1007\/978-1-4757-2491-2_5"},{"key":"48_CR22","unstructured":"A. D. McAulay. Optical Computer Architectures, John Wiley, 1991."},{"key":"48_CR23","unstructured":"M. Mihail, C. Kaklamanis, S. Rao, \u201cEfficient Access to Optical Bandwidth\u201d, Proceedings of 36th Annual IEEE Symposium on Foundations of Computer Science (FOCS'95), (1995), 548\u2013557."},{"key":"48_CR24","doi-asserted-by":"crossref","unstructured":"A. Pelc, \u201cFault Tolerant Broadcasting and Gossiping in Communication Networks\u201d, NETWORKS, to appear.","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N"},{"key":"48_CR25","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/35.186364","volume":"31","author":"R. Ramaswami","year":"1993","unstructured":"R. Ramaswami, \u201cMulti-Wavelength Lightwave Networks for Computer Communication\u201d, IEEE Communication Magazine, vol. 31, (1993), 78\u201388.","journal-title":"IEEE Communication Magazine"},{"key":"48_CR26","unstructured":"Y. Rabani. \u201cPath Coloring on the Meshes\u201d, Proc. of FOCS '96."},{"key":"48_CR27","doi-asserted-by":"crossref","unstructured":"P. Raghavan and E. Upfal. \u201cEfficient Routing in All-Optical Networks\u201d, Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC'94), (1994), 134\u2013143.","DOI":"10.1145\/195058.195119"},{"key":"48_CR28","volume-title":"Transversal Theory","author":"L. Mirsky","year":"1971","unstructured":"L. Mirsky, Transversal Theory, Academic Press, New York, London, 1971."},{"key":"48_CR29","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/2.191977","volume":"26","author":"R. J. Vetter","year":"1993","unstructured":"R. J. Vetter and D. H. C. Du. \u201cDistributed Computing with High-Speed Optical Networks\u201d, IEEE Computer, vol. 26, (1993), 8\u201318.","journal-title":"IEEE Computer"},{"key":"48_CR30","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/0220027","volume":"20","author":"O. Wolfson","year":"1991","unstructured":"O. Wolfson and A. Segall, \u201cThe Communication Complexity of Atomic Commitment and Gossiping\u201d, SIAM J. on Computing, 20 (1991), 423\u2013450.","journal-title":"SIAM J. on Computing"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63165-8_206.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:16:28Z","timestamp":1605629788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63165-8_206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631651","9783540691945"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-63165-8_206","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}