{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T11:12:25Z","timestamp":1781089945184,"version":"3.54.1"},"reference-count":13,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1051\/ro\/2015024","type":"journal-article","created":{"date-parts":[[2015,6,26]],"date-time":"2015-06-26T08:06:40Z","timestamp":1435306000000},"page":"315-325","source":"Crossref","is-referenced-by-count":3,"title":["Linear time algorithms to solve the linear ordering problem for oriented tree based graphs"],"prefix":"10.1051","volume":"50","author":[{"given":"Alain","family":"Quilliot","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Djamal","family":"Rebaine","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"250","published-online":{"date-parts":[[2016,3,21]]},"reference":[{"key":"R1","unstructured":"S. Achouri, T. Bossart and A. Munier-Kordon, A polynomial algorithm for MINDSC on a subclass of serie parallel graphs.RAIRO: OR(2009) 145\u2013156."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Adolphson D. and Hu T.C., Optimal Linear ordering.SIAM J. Appl. Math.25(1973) 403-423.","DOI":"10.1137\/0125042"},{"key":"R3","unstructured":"Charon I. and Hudry O., An updated survey on the linear ordering problem for weighted or unweighted tournaments.Ann. Oper. Res.175(2010) 107\u2013158."},{"key":"R4","unstructured":"Chung F.R.K., On optimal linear arrangements of trees.Comput. Math. Appl.10(1984) 43\u201360."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"J. Cohen, F. Fomin, P. Heggernes, D. Kratsch and G. Kucherov, Optimal Linear Arrangement of Interval Graphs,Proc. of MFCS\u201906 Proceedings of the 31st International Conference on Mathematical Foundations of Computer Science. Springer-Verlag, Berlin, Heidelberg (2006) 267\u2013279.","DOI":"10.1007\/11821069_24"},{"key":"R6","unstructured":"Corneil D.G., Kim H., Natarajan S., Olariu S. and Sprague A.P., A simple linear time algorithm of unit interval graphs.Inf. Process. Lett.55(1995) 99\u2013104."},{"key":"R7","unstructured":"S. Dasgupta, Ch. Papadimitriou and U.V. Vazirani, Algorithms. McGrawHill (2006)."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"Diaz J., Petit J. and Serna M., A survey of graph layout problems.J. ACM Comput. Surveys349(2002) 313\u2013356.","DOI":"10.1145\/568522.568523"},{"key":"R9","unstructured":"M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-Completeness. Computer Press (1979)."},{"key":"R10","unstructured":"S.B. Horton,The optimal linear arrangement problem: algorithms ans approximation. Ph.D. thesis, Georgia Institute of Technology (1997)."},{"key":"R11","unstructured":"Kubiak W., Rebaine D. and Potts C., HLF is optimal for scheduling a divide and conquer graph onmidentical parallel machines.Discrete Optim.6(2009) 79\u201391."},{"key":"R12","unstructured":"V.J. Rayward-Smith and A.J. Clark, Scheduling theory applied to divide and conquer task systems on identical parallel machines, inConpar\u201988, BCS Work shop Series. Edited by C.R. Jessehope, K.D. Reinartz. Cambridge University Press, Cambridge (1989)."},{"key":"R13","unstructured":"Valdes J., Tarjan R.E. and Lawler E.L., The recognition of series parallel digraphs.SIAM J. Comput.11(1982) 298\u2013317."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2015024\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T18:51:48Z","timestamp":1566931908000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2015024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,21]]},"references-count":13,"journal-issue":{"issue":"2"},"alternative-id":["ro150024"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2015024","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,21]]}}}