{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T17:05:41Z","timestamp":1760547941040},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,6,1]],"date-time":"1983-06-01T00:00:00Z","timestamp":423273600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1983,6]]},"DOI":"10.1016\/0196-6774(83)90039-1","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"101-120","source":"Crossref","is-referenced-by-count":25,"title":["Shifting algorithms for tree partitioning with general weighting functions"],"prefix":"10.1016","volume":"4","author":[{"given":"Ronald I","family":"Becker","sequence":"first","affiliation":[]},{"given":"Yehoshua","family":"Perl","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(83)90039-1_BIB1","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. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(83)90039-1_BIB2","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0196-6774(83)90039-1_BIB3","author":"Knuth","year":"1969"},{"key":"10.1016\/0196-6774(83)90039-1_BIB4","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. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(83)90039-1_BIB5","doi-asserted-by":"crossref","unstructured":"Y. Perl, and Y. Shiloach, Efficient optimization of monotonic functions on trees, SIAM J. of Algebraic and Discrete Methods, to appear.","DOI":"10.1007\/3-540-10828-9_73"},{"key":"10.1016\/0196-6774(83)90039-1_BIB6","doi-asserted-by":"crossref","unstructured":"Y. Perl, and M. Snir, Circuit partitioning with size and connection constraints, Networks, to appear.","DOI":"10.1002\/net.3230130305"},{"key":"10.1016\/0196-6774(83)90039-1_BIB7","unstructured":"Y. Perl, and U. Viskin, Efficient implementation of a shifting algorithm, DCS Technical Report, Rutgers University."},{"key":"10.1016\/0196-6774(83)90039-1_BIB8","series-title":"Proceedings, 16th Annual Conference on Information Science and Systems","article-title":"A shifting algorithm for constrained min-max partition on trees","author":"Agasi","year":"1982"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677483900391?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677483900391?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:51:26Z","timestamp":1548744686000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677483900391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,6]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,6]]}},"alternative-id":["0196677483900391"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(83)90039-1","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1983,6]]}}}