{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:59:30Z","timestamp":1774418370129,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"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":6529,"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":[[1995,9]]},"DOI":"10.1016\/0166-218x(94)00143-2","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"15-34","source":"Crossref","is-referenced-by-count":21,"title":["The shifting algorithm technique for the partitioning of trees"],"prefix":"10.1016","volume":"62","author":[{"given":"Ronald I.","family":"Becker","sequence":"first","affiliation":[]},{"given":"Yehoshua","family":"Perl","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)00143-2_BIB1","series-title":"Proceeding of the Conference on Information Sciences and Systems","first-page":"253","article-title":"A shifting algorithm for constrained min-max partition of trees","author":"Agasi","year":"1982"},{"key":"10.1016\/0166-218X(94)00143-2_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(93)90137-D","article-title":"A shifting algorithm for constrained min-max partition of trees","volume":"45","author":"Agasi","year":"1993","journal-title":"Discrete Applied Math."},{"key":"10.1016\/0166-218X(94)00143-2_BIB3_1","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/322290.322294","article-title":"A shifting algorithm for min-max tree-partitioning","volume":"29","author":"Becker","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(94)00143-2_BIB3_2","series-title":"Seventh ICALP Colloquium","first-page":"64","article-title":"Automata, Languages and Programming","author":"Becker","year":"1980"},{"key":"10.1016\/0166-218X(94)00143-2_BIB4","first-page":"27","article-title":"An efficient algorithm for min-max tree partition","volume":"2","author":"Becker","year":"1982","journal-title":"Quaestiones Inform."},{"key":"10.1016\/0166-218X(94)00143-2_BIB5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0196-6774(83)90039-1","article-title":"Shifting algorithms for tree partitioning with general weighting functions","volume":"4","author":"Becker","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(94)00143-2_BIB6","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1080\/00207168408803439","article-title":"A bottom-up algorithm for weight-and height-bounded minimal partition of trees","volume":"16","author":"Becker","year":"1984","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0166-218X(94)00143-2_BIB7","series-title":"Computers and Intractability","author":"Gary","year":"1979"},{"key":"10.1016\/0166-218X(94)00143-2_BIB8","series-title":"Proceedings of the 5th Southeast Conference on Combinatorics, Graph Theory and Computing","first-page":"449","article-title":"Minimum spanning forests of bounded trees","author":"Hadlock","year":"1974"},{"key":"10.1016\/0166-218X(94)00143-2_BIB9","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0166-218X(94)00143-2_BIB10","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0166-218X(94)00143-2_BIB11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0206012","article-title":"A linear tree-partitioning algorithm","volume":"6","author":"Kundu","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(94)00143-2_BIB12","series-title":"Proceedings of the 24th Allerton Conference on Communication Control and Computing","first-page":"69","article-title":"How hard is it to partition a path","author":"Lucertini","year":"1986"},{"key":"10.1016\/0166-218X(94)00143-2_BIB13","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0166-218X(93)90048-S","article-title":"Most uniform path partitioning and its use in image processing","volume":"42","author":"Lucertini","year":"1993","journal-title":"Discrete Applied Math."},{"key":"10.1016\/0166-218X(94)00143-2_BIB14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/322234.322236","article-title":"Max-min tree-partitioning","volume":"28","author":"Perl","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(94)00143-2_BIB15","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1137\/0604050","article-title":"Efficient optimization of monotonic functions on trees","volume":"4","author":"Perl","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(94)00143-2_BIB16","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1002\/net.3230130305","article-title":"Circuit partitioning with size and connection constraints","volume":"13","author":"Perl","year":"1983","journal-title":"Networks"},{"key":"10.1016\/0166-218X(94)00143-2_BIB17","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0166-218X(85)90041-1","article-title":"Efficient implementation of a shifting algorithm","volume":"12","author":"Perl","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(94)00143-2_BIB18","series-title":"Automatic Information Organization and Retrieval","author":"Salton","year":"1968"},{"key":"10.1016\/0166-218X(94)00143-2_BIB19","series-title":"Operating Systems","author":"Tsichritzis","year":"1974"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94001432?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94001432?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T03:55:54Z","timestamp":1555300554000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94001432"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["0166218X94001432"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)00143-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}