{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T19:09:09Z","timestamp":1649012949646},"reference-count":8,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1016\/0020-0190(94)00102-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"223-226","source":"Crossref","is-referenced-by-count":2,"title":["Parallel algorithm for finding a core of a tree network"],"prefix":"10.1016","volume":"51","author":[{"given":"Eliezer A.","family":"Albacea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00102-2_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\/0020-0190(94)00102-2_BIB2","series-title":"Concurrent Computations: Algorithms, Architecture, and Technology","article-title":"Optimal tree contraction in the EREW model","author":"Gazit","year":"1988"},{"key":"10.1016\/0020-0190(94)00102-2_BIB3","series-title":"Location on Networks: Theory and Algorithms","author":"Handler","year":"1979"},{"key":"10.1016\/0020-0190(94)00102-2_BIB4","first-page":"478","article-title":"Parallel tree contraction and its applications","author":"Miller","year":"1985","journal-title":"Proc. 26th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(94)00102-2_BIB5","first-page":"392","article-title":"Systematic methods for tree based parallel algorithm development","author":"Miller","year":"1987","journal-title":"Proc. 2nd Internat. Conf. on Supercomputing"},{"key":"10.1016\/0020-0190(94)00102-2_BIB6","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0196-6774(83)90015-9","article-title":"On finding the core of a tree with a specified length","volume":"4","author":"Minieka","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(94)00102-2_BIB7","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0196-6774(80)90012-7","article-title":"A linear algorithm for a core of a tree","volume":"1","author":"Morgan","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(94)00102-2_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.16.1.1","article-title":"Locating central paths in a graph","volume":"16","author":"Slater","year":"1982","journal-title":"Transportation Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001022?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001022?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:51:45Z","timestamp":1555145505000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094001022"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0020019094001022"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00102-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}