{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:33:09Z","timestamp":1766377989722},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":4764,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0166-218x(00)00173-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:38:45Z","timestamp":1027651125000},"page":"127-139","source":"Crossref","is-referenced-by-count":6,"title":["On minimum cuts and the linear arrangement problem"],"prefix":"10.1016","volume":"103","author":[{"given":"S.B.","family":"Horton","sequence":"first","affiliation":[]},{"given":"R.Gary","family":"Parker","sequence":"additional","affiliation":[]},{"given":"R.B.","family":"Borie","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00173-6_BIB1","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\/S0166-218X(00)00173-6_BIB2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","article-title":"Easy problems for tree-decomposable graphs","volume":"12","author":"Arnborg","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(00)00173-6_BIB3","unstructured":"S.L. Bezrukov, Edge isoperimetric problems on graphs, in: L. Lovasz, A. Gyarfas, G.O.H. Katona, A. Recski, L. Szekely (Eds.), Graph Theory and Combinatorial Biology; Bolyai Soc. Math. Stud. 7 Budapest, 1999, pp. 157\u2013197."},{"key":"10.1016\/S0166-218X(00)00173-6_BIB4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01293664","article-title":"Generation of polynomial time algorithms for some optimization problems on tree-decomposable graphs","volume":"14","author":"Borie","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(00)00173-6_BIB5","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1137\/0404043","article-title":"Deterministic decomposition of recursive graph classes","volume":"4","author":"Borie","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(00)00173-6_BIB6","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BF01758777","article-title":"Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families","volume":"7","author":"Borie","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(00)00173-6_BIB7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0898-1221(84)90085-3","article-title":"On optimal linear arrangements of trees","volume":"10","author":"Chung","year":"1984","journal-title":"Comput. Maths. Appl."},{"key":"10.1016\/S0166-218X(00)00173-6_BIB8","series-title":"Monadic second-order evaluations on tree-decomposable graphs, Graph-Theoretic Concepts in Computer Science, Proceedings of the 17th International Workshop","author":"Courcelle","year":"1991"},{"key":"10.1016\/S0166-218X(00)00173-6_BIB9","first-page":"3","article-title":"A solvable case of the linear arrangement problem on Halin graphs","volume":"119","author":"Easton","year":"1996","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(00)00173-6_BIB10","doi-asserted-by":"crossref","unstructured":"P. Fishburn, P. Tetali, P. Winkler, Optimal linear arrangements of a rectangular grid, Discrete Math., to appear.","DOI":"10.1016\/S0012-365X(99)00173-9"},{"key":"10.1016\/S0166-218X(00)00173-6_BIB11","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/31.1745","article-title":"Planar linear arrangements of outerplanar graphs","volume":"35","author":"Frederickson","year":"1988","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/S0166-218X(00)00173-6_BIB12","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(00)00173-6_BIB13","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\/S0166-218X(00)00173-6_BIB14","unstructured":"S.B. Horton, The optimal linear arrangement problem: algorithms and approximation, Ph.D. Thesis, Georgia Institute of Technology, 1997."},{"key":"10.1016\/S0166-218X(00)00173-6_BIB15","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0166-218X(92)90229-4","article-title":"Optimal linear labelings and eigenvalues of graphs","volume":"36","author":"Juvan","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00173-6_BIB16","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0166-218X(93)E0168-X","article-title":"Generating lower bounds for the linear arrangement problem","volume":"59","author":"Liu","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00173-6_BIB17","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1137\/0607063","article-title":"Optimal numberings of an N \u00d7 N array","volume":"7","author":"Mitchison","year":"1986","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(00)00173-6_BIB18","article-title":"Minimal numberings of vertices of a rectangular lattice (in Russian)","volume":"70","author":"Muradyan","year":"1980","journal-title":"Akad. Nauk. Armjan. SSR. Dokl."},{"key":"10.1016\/S0166-218X(00)00173-6_BIB19","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1002\/nav.3800320308","article-title":"On finding spanning eulerian subgraphs","volume":"32","author":"Richey","year":"1985","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/S0166-218X(00)00173-6_BIB20","unstructured":"T.V. Wimer, S.T. Hedetniemi, K-terminal recursive families of graphs, Proceedings of the 250th Anniversary Conference on Graph Theory, Fort Wayne, IN, 1986."},{"key":"10.1016\/S0166-218X(00)00173-6_BIB21","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."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00001736?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00001736?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T11:20:04Z","timestamp":1555240804000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00001736"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0166218X00001736"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00173-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}