{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T19:53:17Z","timestamp":1760644397220},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5860,"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":[[1997,7]]},"DOI":"10.1016\/s0304-3975(96)00274-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"267-287","source":"Crossref","is-referenced-by-count":9,"title":["Parallel algorithms for the minimum cut and the minimum length tree layout problems"],"prefix":"10.1016","volume":"181","author":[{"given":"Josep","family":"D\u00edaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Gibbons","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grammati E.","family":"Pantziou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria J.","family":"Serna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacobo","family":"Toran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00274-5_BIB1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","article-title":"A simple parallel tree contraction algorithm","volume":"10","author":"Abrahamson","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(96)00274-5_BIB2","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/0125042","article-title":"Optimal linear ordering","volume":"25","author":"Adolphson","year":"1973","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0304-3975(96)00274-5_BIB3","series-title":"Proc. IEEE Symp. on Foundations of Computer Science (FOCS)","first-page":"262","article-title":"Polynomial time algorithms for the min cut problem on degree restricted trees","author":"Chung","year":"1982"},{"key":"10.1016\/S0304-3975(96)00274-5_BIB4","series-title":"Proc. of Symp. on Mathematical Foundations of Computer Science (MFCS)","first-page":"14","article-title":"Graph layout problems","volume":"Vol. 629","author":"D\u00edaz","year":"1992"},{"key":"10.1016\/S0304-3975(96)00274-5_BIB5","series-title":"Proc. Computing and Combinatorics Conf. (COCOON)","article-title":"Parallel algorithms for some tree layout problems","author":"D\u00edaz","year":"1995"},{"key":"10.1016\/S0304-3975(96)00274-5_BIB6","article-title":"NP-completeness of several arrangements problems","author":"Even","year":"1978"},{"key":"10.1016\/S0304-3975(96)00274-5_BIB7","series-title":"Proc. 11th. Conf. on Information Sciences and Systems","first-page":"91","article-title":"Some NP-complete problems on graphs","author":"Gavril","year":"1977"},{"key":"10.1016\/S0304-3975(96)00274-5_BIB8","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(96)00274-5_BIB9","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","article-title":"Optimal numberings and isoperimetric problems on graphs","volume":"1","author":"Harper","year":"1966","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0304-3975(96)00274-5_BIB10","first-page":"869","article-title":"Parallel algorithms for shared memory machines","volume":"Vol. A","author":"Karp","year":"1990"},{"key":"10.1016\/S0304-3975(96)00274-5_BIB11","series-title":"Proc. 13th Coll. on Automata, Languages and Programming (ICALP)","first-page":"265","article-title":"Min cut is NP-complete for edge weighted trees","author":"Monien","year":"1986"},{"key":"10.1016\/S0304-3975(96)00274-5_BIB12","series-title":"Layout Design and Verification","first-page":"267","article-title":"Computational complexity of layout problems","author":"Shing","year":"1986"},{"key":"10.1016\/S0304-3975(96)00274-5_BIB13","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1137\/0208002","article-title":"A minimum linear arrangement algorithm for undirected trees","volume":"8","author":"Shiloach","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00274-5_BIB14","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1145\/4221.4228","article-title":"A polynomial algorithm for the min cut linear arrangement of trees","volume":"32","author":"Yannakakis","year":"1985","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002745?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002745?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:58:40Z","timestamp":1555419520000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002745"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["S0304397596002745"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00274-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}