{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T12:03:13Z","timestamp":1743595393412},"reference-count":28,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00635-7","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T16:52:06Z","timestamp":1048611126000},"page":"119-143","source":"Crossref","is-referenced-by-count":4,"title":["The permutation-path coloring problem on trees"],"prefix":"10.1016","volume":"297","author":[{"given":"Sylvie","family":"Corteel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Valencia-Pabon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dani\u00e8le","family":"Gardy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Barth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Denise","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00635-7_BIB1","unstructured":"Y. Aumann, Y. Rabani, Improved bounds for all optical routing, Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, 1995, pp. 567\u2013576."},{"issue":"4","key":"10.1016\/S0304-3975(02)00635-7_BIB2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1006\/eujc.1993.1031","article-title":"Permutations suivant le type d'exc\u00e9dance et le nombre d'inversions et interpr\u00e9tation combinatoire d'une fraction continue de Heine","volume":"14","author":"Biane","year":"1993","journal-title":"Eur. J. Comb."},{"key":"10.1016\/S0304-3975(02)00635-7_BIB3","article-title":"Graph Theory, An Introductory Course","volume":"vol. 63","author":"Bollob\u00e0s","year":"1979"},{"key":"10.1016\/S0304-3975(02)00635-7_BIB4","unstructured":"I. Caragiannis, Ch. Kaklamanis, P. Persiano, Wavelength routing of symmetric communication requests in directed fiber trees, Proc. 5th Internat. Colloquium on Structural Information and Communication Complexity (SIROCCO), Carleton Scientific, 1998."},{"key":"10.1016\/S0304-3975(02)00635-7_BIB5","doi-asserted-by":"crossref","unstructured":"N.K. Cheung, K. Nosu, G. Winzer (Eds.), Special issue on dense wavelength division multiplexing techniques for high capacity and multiple access communications systems, IEEE Journal on Selected Areas in Communications, vol. 8(6), 1990.","DOI":"10.1109\/49.57828"},{"key":"10.1016\/S0304-3975(02)00635-7_BIB6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.2307\/1427162","article-title":"The maximum of a Gaussian process whose mean path has a maximum, with an application to the strength of bundles of fibres","volume":"21","author":"Daniels","year":"1989","journal-title":"Adv. Appl. Probab."},{"key":"10.1016\/S0304-3975(02)00635-7_BIB7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.2307\/1427054","article-title":"The maximum of a random walk whose mean path has a maximum","volume":"17","author":"Daniels","year":"1985","journal-title":"Adv. Appl. Probab."},{"key":"10.1016\/S0304-3975(02)00635-7_BIB8","doi-asserted-by":"crossref","unstructured":"T. Erlebach, K. Jansen. Call scheduling in trees, rings and meshes, Proc. 30th Hawaii Internat. Conf. on System Sciences (HICSS-30), vol. 1, IEEE CS Press, 1997, pp. 221\u2013222.","DOI":"10.1109\/HICSS.1997.667220"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(02)00635-7_BIB9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0304-3975(99)00029-8","article-title":"Optimal wavelength routing on directed fiber trees","volume":"221","author":"Erlebach","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00635-7_BIB10","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0012-365X(80)90050-3","article-title":"Combinatorial aspects of continued fractions","volume":"32","author":"Flajolet","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(02)00635-7_BIB11","article-title":"Eulerian graphs and related topics","volume":"vol. 2(45)","author":"Fleischner","year":"1991"},{"key":"10.1016\/S0304-3975(02)00635-7_BIB12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0012-365X(79)90182-1","article-title":"Permutations selon leurs pics, creux, doubles mont\u00e9es et doubles descentes, nombres d'Euler et nombres de Genocchi","volume":"28","author":"Fran\u00e7on","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(02)00635-7_BIB13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(94)00305-3","article-title":"Dynamic analysis of some relational databases parameters","volume":"144","author":"Gardy","year":"1995","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(02)00635-7_BIB14","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0601025","article-title":"The complexity of coloring circular arcs and chords","volume":"1","author":"Garey","year":"1980","journal-title":"SIAM J. Alg. Discrete Meth."},{"key":"10.1016\/S0304-3975(02)00635-7_BIB15","series-title":"Proc. 24th Internat. Colloq. on Automata","first-page":"505","article-title":"Coloring all directed paths in a symmetric tree with applications to WDM routing","volume":"vol. 1256","author":"Gargano","year":"1997"},{"key":"10.1016\/S0304-3975(02)00635-7_BIB16","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"issue":"2","key":"10.1016\/S0304-3975(02)00635-7_BIB17","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1006\/jpdc.1997.1358","article-title":"Routing a permutation in the Hypercube by two sets of edge-disjoint paths","volume":"44","author":"Gu","year":"1997","journal-title":"J. Parallel Distribut. Comput."},{"key":"10.1016\/S0304-3975(02)00635-7_BIB18","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/net.3230120410","article-title":"Efficient algorithms for interval graphs and circular-arc graphs","volume":"12","author":"Gupta","year":"1982","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(02)00635-7_BIB19","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0020-0190(97)00077-X","article-title":"A note on optical routing on trees","volume":"62","author":"Kumar","year":"1997","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"10.1016\/S0304-3975(02)00635-7_BIB20","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0169-7552(85)90070-4","article-title":"On the capacity of disjointly shared networks","volume":"10","author":"Lagarias","year":"1985","journal-title":"Computer Networks ISDN Syst."},{"key":"10.1016\/S0304-3975(02)00635-7_BIB21","doi-asserted-by":"crossref","unstructured":"F.T. Leighton, S. Rao, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, Proc. 29th IEEE FOCS, 1988, pp. 422\u2013431.","DOI":"10.1109\/SFCS.1988.21958"},{"key":"10.1016\/S0304-3975(02)00635-7_BIB22","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(87)90028-4","article-title":"Random walks, Gaussian processes and list structures","volume":"53","author":"Louchard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00635-7_BIB23","unstructured":"D.W. Matula, F. Shahrokhi, The Maximum Concurrent Flow Problem and Sparsest Cuts, Technical Report, Southern Methodist University, March 1986."},{"key":"10.1016\/S0304-3975(02)00635-7_BIB24","unstructured":"M. Paterson, H. Schr\u00f6der, O. S\u00fdkora, I. Vr\u0165o, On permutation communications in all-optical rings, Proc. 5th Internat. Colloq. on Structural Information and Communication Complexity (SIROCCO). Carleton Scientific, 1998."},{"key":"10.1016\/S0304-3975(02)00635-7_BIB25","doi-asserted-by":"crossref","unstructured":"P. Raghavan, E. Upfal, Efficient routing in all optical networks, Proc. 26th ACM Symp. on Theory of Computing, 1994, pp. 133\u2013143.","DOI":"10.1145\/195058.195119"},{"issue":"3","key":"10.1016\/S0304-3975(02)00635-7_BIB26","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1137\/0129040","article-title":"Coloring a family of circular arcs","volume":"29","author":"Tucker","year":"1975","journal-title":"SIAM J. Appl. Maths."},{"key":"10.1016\/S0304-3975(02)00635-7_BIB27","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BFb0076539","article-title":"A combinatorial theory for general orthogonal polynomials with extensions and applications","volume":"171","author":"Viennot","year":"1985","journal-title":"Lect. Notes Math."},{"key":"10.1016\/S0304-3975(02)00635-7_BIB28","unstructured":"G. Wilfong, P. Winkler, Ring routing and wavelength translation, Proc. 9th Annual ACM-SIAM Symp. on Discrete Algorithms, 1998, pp. 333\u2013341."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502006357?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502006357?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T16:57:20Z","timestamp":1584032240000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502006357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":28,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0304397502006357"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00635-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}