{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:10:06Z","timestamp":1737504606630,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_43","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"518-529","source":"Crossref","is-referenced-by-count":4,"title":["Decidable Properties of Graphs of All-Optical Networks"],"prefix":"10.1007","author":[{"given":"Luciano","family":"Margara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janos","family":"Simon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/0196-6774(85)90022-7","volume":"6","author":"R. P. Anstee","year":"1985","unstructured":"R. P. Anstee. An algorithmic proof of Tutte\u2019s f-factor theorem. Journal of Algorithms, 6:112\u2013131, 1985.","journal-title":"Journal of Algorithms"},{"key":"43_CR2","unstructured":"B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Perennes, and U. Vaccaro. Graph problems arising from wavelength-routing in all-optical networks. Proc. Of Workshop on Optics in Computer Science WOCS\u201997"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"N. K. Cheung, N. K., and G. Winzer. Special issue on dense WDM networks. Journal on Selected Areas in Communications, 8, 1990.","DOI":"10.1109\/49.57828"},{"key":"43_CR4","unstructured":"T. Erlebach and K. Jansen. Scheduling of virtual connections in fast networks. In Proc. of Parallel Systems and Algorithms (PASA), pages 13\u201332, 1996."},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"T. Erlebach and K. Jansen. Call scheduling in trees, rings and meshes. In Proc. of HICSS, 1997.","DOI":"10.1109\/HICSS.1997.667220"},{"issue":"B","key":"43_CR6","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0095-8956(85)90088-7","volume":"38","author":"M. C. Golumbic","year":"1985","unstructured":"M. C. Golumbic and R. E. Jamison. The edge intersection graphs of paths in a tree. Journal of Combinatorial Theory, Series B, 38:8\u201322, 1985.","journal-title":"Journal of Combinatorial Theory"},{"key":"43_CR7","unstructured":"P. E. Green. Fiber-optic communication networks. Prentice-Hall, 1993."},{"issue":"4","key":"43_CR8","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"I. Holyer. The NP-completeness of edge coloring. SIAM Journal of Computing, 10(4):718\u2013720, 1981.","journal-title":"SIAM Journal of Computing"},{"key":"43_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/3-540-63165-8_205","volume-title":"Proc. of ICALP\u201997","author":"C. Kaklamanis","year":"1997","unstructured":"C. Kaklamanis, G. Persiano, T. Erlebach,and K. Jansen. Constrained bipartite edge coloring with applications to wavelength routing. Proc. of ICALP\u201997, Lecture notes in Computer Science vol. 1256:493\u2013504, 1997."},{"key":"43_CR10","unstructured":"R. Klasing. Methods and problems of wavelength-routing in all-optical networks. In Proc. of the MFCS\u201998 Workshop on Communication, 1998."},{"key":"43_CR11","unstructured":"J. Kleinberg and A. Kumar. Wavelength conversion in optical networks In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms, 1999."},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"G. Li and R. Simha On the wavelength assignment problem in multifiber WDM star and ring networks In Proc. IEEE INFOCOM, 2000.","DOI":"10.1117\/12.402532"},{"key":"43_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01894680","volume":"19","author":"L. Lov\u00e1sz","year":"1968","unstructured":"L. Lov\u00e1sz. On chromatic number of finite set-systems. Acta Math. Acad. Sci. Hungar, 19:59\u201367, 1968.","journal-title":"Acta Math. Acad. Sci. Hungar"},{"key":"43_CR14","unstructured":"A. D. McAulay. Optical computer architectures. John Wiley, 1991."},{"key":"43_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1007\/3-540-45022-X_64","volume-title":"Proc. of ICALP2000","author":"L. Margara","year":"2000","unstructured":"L. Margara and J. Simon Wavelength assignment problem on all-optical networks with k fibers per link Proc. of ICALP2000, Lecture notes in Computer Science vol. 1853:768\u2013779, 2000."},{"key":"43_CR16","doi-asserted-by":"crossref","unstructured":"M. Mihail, C. Kaklamanis, and S. Rao. Efficient access to optical bandwidth\u2014 wavelength routing on directed fiber trees, rings, and trees of rings. In Proc. Of 36th IEEE-FOCS, pp. 548\u2013557, 1995.","DOI":"10.1109\/SFCS.1995.492585"},{"key":"43_CR17","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1109\/90.392386","volume":"3","author":"R. K. Pankaj","year":"1995","unstructured":"R. K. Pankaj and R. G. Gallager. Wavelength requirements of all-optical networks. IEEE\/ACM Trans. on Networking, 3:269\u2013280, 1995.","journal-title":"IEEE\/ACM Trans. on Networking"},{"key":"43_CR18","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J. Petersen","year":"1891","unstructured":"J. Petersen. Die Theorie der Regul\u00e4ren Graphen. Acta Math. 15, 193\u2013220, 1891.","journal-title":"Acta Math."},{"issue":"2","key":"43_CR19","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/35.186364","volume":"31","author":"R. Ramaswami","year":"1993","unstructured":"R. Ramaswami. Multiwavelength lightwave networks for computer communication. IEEE Communications Magazine, 31(2):78\u201388, Feb. 1993.","journal-title":"IEEE Communications Magazine"},{"issue":"2","key":"43_CR20","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"R. E. Tarjan","year":"1985","unstructured":"R. E. Tarjan. Decomposition by clique separators. Discrete Mathematics, 55(2):221\u2013232, 1985.","journal-title":"Discrete Mathematics"},{"issue":"3","key":"43_CR21","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1137\/0129040","volume":"29","author":"A. Tucker","year":"1975","unstructured":"A. Tucker. Coloring a family of circular arcs. SIAM Journal of Applied Mathematics, 29(3):493\u2013502, 1975.","journal-title":"SIAM Journal of Applied Mathematics"},{"issue":"2","key":"43_CR22","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. Distributed computing with high-speed optical networks. IEEE Computer, 26(2):8\u201318, Feb. 1993.","journal-title":"IEEE Computer"},{"key":"43_CR23","unstructured":"G. Wilfong and P. Winkler. Ring routing and wavelength translation. In Proc. Of the 9th Annual ACM-SIAM Symposium on on Discrete Algorithms (SODA), pp. 333\u2013341, 1998."}],"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-48224-5_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:49:58Z","timestamp":1737503398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_43","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}