{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,30]],"date-time":"2022-10-30T04:41:36Z","timestamp":1667104896178},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,9,9]],"date-time":"2022-09-09T00:00:00Z","timestamp":1662681600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,9,9]],"date-time":"2022-09-09T00:00:00Z","timestamp":1662681600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10878-022-00900-y","type":"journal-article","created":{"date-parts":[[2022,9,9]],"date-time":"2022-09-09T07:04:41Z","timestamp":1662707081000},"page":"3495-3519","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Linear time algorithms on mirror trees"],"prefix":"10.1007","volume":"44","author":[{"given":"Alain","family":"Quilliot","sequence":"first","affiliation":[]},{"given":"Djamal","family":"Rebaine","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,9]]},"reference":[{"issue":"3","key":"900_CR1","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/0125042","volume":"25","author":"D Adolphson","year":"1973","unstructured":"Adolphson D, HU TC (1973) Optimal linear ordering. SIAM J Appl Math 25(3):403\u2013423","journal-title":"SIAM J Appl Math"},{"key":"900_CR2","doi-asserted-by":"publisher","first-page":"1795","DOI":"10.1016\/j.dam.2007.03.019","volume":"155","author":"T Bossart","year":"2007","unstructured":"Bossart T, Munier-Kordon A, Sourd F (2007) Memory management optimization problems for integrated circuit simulators. Discret Appl Math 155:1795\u20131811","journal-title":"Discret Appl Math"},{"key":"900_CR3","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.endm.2015.05.018","volume":"48","author":"SA Boxwala","year":"2015","unstructured":"Boxwala SA, Vashishta P (2015) Some new families of graceful graphs. Electron Notes Discrete Math 48:127\u2013133","journal-title":"Electron Notes Discrete Math"},{"issue":"1","key":"900_CR4","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejc.2003.09.004","volume":"25","author":"B Bresar","year":"2004","unstructured":"Bresar B, Klavzar S, Lipovec A, Mohar B (2004) Cubic inflation, mirror graphs, regular maps, and partial cubes. Eur J Comb 25(1):55\u201364","journal-title":"Eur J Comb"},{"key":"900_CR5","volume-title":"Algorithms","author":"S Dasgupta","year":"2006","unstructured":"Dasgupta S, Papadimitriou CH, Vazirani UV (2006) Algorithms. McGraw Hill, New York"},{"key":"900_CR6","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman and co., New York"},{"key":"900_CR7","volume-title":"Fundamentals of computer algorithms","author":"E Horowitz","year":"1978","unstructured":"Horowitz E, Sahni S (1978) Fundamentals of computer algorithms. Computer Science Press"},{"key":"900_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.disopt.2008.09.001","volume":"6","author":"W Kubiak","year":"2009","unstructured":"Kubiak W, Rebaine D, Potts CN (2009) HLF is optimal for scheduling a divide-and-conquer unit tasks on $$m$$ identical parallel processors. J Discrete Optim 6:79\u201391","journal-title":"J Discrete Optim"},{"issue":"2","key":"900_CR9","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s41478-018-0088-3","volume":"27","author":"G Mahadevan","year":"2019","unstructured":"Mahadevan G, Vijayalakshmi V, Avadayappan S (2019) Non split hop domination number for some mirror graphs and cartesian product of two distinct paths. J Anal 27(2):475\u2013491","journal-title":"J Anal"},{"key":"900_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.ejc.2017.03.001","volume":"63","author":"T Marc","year":"2017","unstructured":"Marc T (2017) Mirror graphs: graph theoretical characterization of reflection arrangements and finite Coxeter groups, European. J Combin 63:115\u2013123","journal-title":"J Combin"},{"issue":"1","key":"900_CR11","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/s10878-019-00464-4","volume":"39","author":"MG Millani","year":"2020","unstructured":"Millani MG, Molter H, Niedermeier R, Sorge M (2020) Efficient algorithms for measuring the funnel-likeness of DAGs. J Comb Optim 39(1):216\u2013245","journal-title":"J Comb Optim"},{"key":"900_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1051\/ro\/2015024","volume":"50","author":"A Quilliot","year":"2016","unstructured":"Quilliot A, Rebaine D (2016) Linear time algorithms to solve the linear ordering problem for oriented tree based graphs. RAIRO 50:315\u2013325","journal-title":"RAIRO"},{"key":"900_CR13","unstructured":"Rayward-Smith VJ, Clark AJ (1989) Scheduling theory applied to divide-and-conquer task systems on identical parallel machines, In: CONPAR \u201988"},{"key":"900_CR14","first-page":"298","volume":"11","author":"J Valdes","year":"1982","unstructured":"Valdes J, Tarjan RE, Lawler EL (1982) The recognition of series parallel digraphs, SIAM. J Comput 11:298\u2013317","journal-title":"J Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00900-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00900-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00900-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T09:39:40Z","timestamp":1667036380000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00900-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,9]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["900"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00900-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,9]]},"assertion":[{"value":"13 August 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}