{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:43:32Z","timestamp":1759063412142},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,12,24]],"date-time":"2010-12-24T00:00:00Z","timestamp":1293148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10288-010-0150-8","type":"journal-article","created":{"date-parts":[[2010,12,23]],"date-time":"2010-12-23T06:40:40Z","timestamp":1293086440000},"page":"175-188","source":"Crossref","is-referenced-by-count":3,"title":["Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree"],"prefix":"10.1007","volume":"9","author":[{"given":"Olivier Durand","family":"de Gevigney","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Meunier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Popa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Reygner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayrin","family":"Romero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,12,24]]},"reference":[{"key":"150_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jctb.1997.1731","volume":"73","author":"R Aharoni","year":"1998","unstructured":"Aharoni R, Holzman R (1998) Fractional kernels in digraphs. J Comb Theor (ser B) 73: 1\u20136","journal-title":"J Comb Theor (ser B)"},{"key":"150_CR2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.tcs.2007.04.028","volume":"384","author":"J-C Bermond","year":"2007","unstructured":"Bermond J-C, Braud L, Coudert D (2007) Traffic grooming on the path. Theor Comput Sci 384: 139\u2013151","journal-title":"Theor Comput Sci"},{"key":"150_CR3","doi-asserted-by":"crossref","unstructured":"Bermond J-C, Cosnard M, Coudert D, P\u00e9rennes S (February 2006) Optimal solution of the maximum all request path grooming problem. In: Proceedings of the advanced international conference on telecommunications, AICT06, Guadeloupe, France","DOI":"10.1109\/AICT-ICIW.2006.144"},{"key":"150_CR4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0012-365X(95)00096-F","volume":"159","author":"E Boros","year":"1996","unstructured":"Boros E, Gurvich V (1996) Perfect graphs are perfect solvable. Discret Math 159: 35\u201355","journal-title":"Discret Math"},{"key":"150_CR5","first-page":"95","volume":"20","author":"I Caragiannis","year":"2001","unstructured":"Caragiannis I, Kaklamanis C, Persiano P (2001) Wavelength routing in all-optical tree networks: A survey. Comput Artif Intell 20: 95\u2013120","journal-title":"Comput Artif Intell"},{"key":"150_CR6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0167-6377(02)00184-0","volume":"31","author":"M-C Costa","year":"2003","unstructured":"Costa M-C, L\u00e9tocart L, Roupin F (2003) A greedy algorithm for multicut and integral multiflow in rooted trees. Oper Res Lett 31: 21\u201327","journal-title":"Oper Res Lett"},{"key":"150_CR7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.ejor.2003.10.037","volume":"162","author":"M-C Costa","year":"2005","unstructured":"Costa M-C, L\u00e9tocart L, Roupin F (2005) Minimal multicut and maximal integer multiflow: a survey. Eur J Oper Res 162: 55\u201369","journal-title":"Eur J Oper Res"},{"key":"150_CR8","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0304-3975(99)00029-8","volume":"221","author":"T Erlebach","year":"1999","unstructured":"Erlebach T, Munchen T, Jansen K, Kaklamanis C, Persiano P (1999) Optimal wavelength routing on directed fiber trees. Theor Comput Sci 221: 119\u2013137","journal-title":"Theor Comput Sci"},{"key":"150_CR9","doi-asserted-by":"crossref","unstructured":"Gale D, Shapley, LS (1962) College admissions and the stability of marriage. American Mathematical Monthly, pp 9\u201315","DOI":"10.1080\/00029890.1962.11989827"},{"key":"150_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N Garg","year":"1997","unstructured":"Garg N, Vazirani VV, Yannakakis Md (1997) Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18: 3\u201320","journal-title":"Algorithmica"},{"key":"150_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric algorithms and combinatorial optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A (1988) Geometric algorithms and combinatorial optimization. Springer, Berlin"},{"key":"150_CR12","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz L (1972) Normal hypergraphs and the perfect graph conjecture. Discret Math 2: 253\u2013267","journal-title":"Discret Math"},{"key":"150_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(92)90028-V","volume":"55","author":"F Maffray","year":"1992","unstructured":"Maffray F (1992) Kernel in perfect line graph. J Comb Theor Ser B 55: 1\u20138","journal-title":"J Comb Theor Ser B"},{"key":"150_CR14","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01934199","volume":"10","author":"DG McVitie","year":"1970","unstructured":"McVitie DG, Wilson LB (1970) Stable marriage assignement for unequal sets. BIT 10: 295\u2013309","journal-title":"BIT"},{"key":"150_CR15","unstructured":"Meggido N, Papadimitriou CH (1989) A note on total functions, existence theorems, and computational complexity. Technical report, IBM"},{"key":"150_CR16","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0095-8956(86)90042-0","volume":"41","author":"CL Monma","year":"1986","unstructured":"Monma CL, Wei VK (1986) Intersection graphs of paths in a tree. J Combin Theor Ser B 41: 141\u2013181","journal-title":"J Combin Theor Ser B"},{"key":"150_CR17","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"C Papadimitriou","year":"1994","unstructured":"Papadimitriou C (1994) On the complexity of the parity argument and other inefficient proofs of existence. J Comput Syst Sci 48: 498\u2013532","journal-title":"J Comput Syst Sci"},{"key":"150_CR18","doi-asserted-by":"crossref","first-page":"573","DOI":"10.2307\/1969755","volume":"58","author":"M Richardson","year":"1953","unstructured":"Richardson M (1953) Solutions of irreflexive relations. Ann Math 58: 573\u2013590","journal-title":"Ann Math"},{"key":"150_CR19","volume-title":"Combinatorial optimization","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization. Springer, Berlin"},{"key":"150_CR20","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"RE Tarjan","year":"1985","unstructured":"Tarjan RE (1985) Decomposition by clique separators. Discret Math 55: 221\u2013232","journal-title":"Discret Math"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-010-0150-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-010-0150-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-010-0150-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T04:27:49Z","timestamp":1559881669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-010-0150-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,24]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["150"],"URL":"https:\/\/doi.org\/10.1007\/s10288-010-0150-8","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,24]]}}}