{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T19:46:18Z","timestamp":1649187978021},"reference-count":24,"publisher":"Elsevier BV","issue":"6-7","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1016\/s0167-8191(05)80054-7","type":"journal-article","created":{"date-parts":[[2005,7,14]],"date-time":"2005-07-14T10:59:21Z","timestamp":1121338761000},"page":"643-656","source":"Crossref","is-referenced-by-count":2,"title":["Parallel computation of matchings in trees"],"prefix":"10.1016","volume":"17","author":[{"given":"Constantine N.K.","family":"Osiakwan","sequence":"first","affiliation":[]},{"given":"Selim G.","family":"Akl","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0167-8191(05)80054-7_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\/S0167-8191(05)80054-7_bib2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0167-8191(05)80054-7_bib3","series-title":"The Design and Analysis of Parallel Algorithms","author":"Akl","year":"1989"},{"issue":"1","key":"10.1016\/S0167-8191(05)80054-7_bib4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0020-0190(84)90128-5","article-title":"An optimal algorithm for parallel selection","volume":"19","author":"Akl","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0167-8191(05)80054-7_bib5","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/S0167-8191(05)80054-7_bib6","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","article-title":"Time bounds for selection","volume":"7","author":"Blum","year":"1973","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/S0167-8191(05)80054-7_bib7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","article-title":"The parallel evaluation of general arithmetic expressions","volume":"21","author":"Brent","year":"1974","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0167-8191(05)80054-7_bib8","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1137\/0217009","article-title":"Approximate parallel scheduling, Part I: the basic technique with applications to optimal list ranking in logarithmic time","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0167-8191(05)80054-7_bib9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0167-8191(90)90143-W","article-title":"Parallel graph algorithms for hypercube computers","volume":"13","author":"Das","year":"1990","journal-title":"Parallel Comput"},{"key":"10.1016\/S0167-8191(05)80054-7_bib10","article-title":"Implementation of algorithms for maximum matching on nonbipartite graphs","author":"Gabow","year":"1974"},{"issue":"1","key":"10.1016\/S0167-8191(05)80054-7_bib11","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1137\/0205009","article-title":"b-matchings in trees","volume":"5","author":"Goodman","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-8191(05)80054-7_bib12","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0196-6774(88)90007-7","article-title":"Binary algebraic computation and parallel algorithms for simple graphs","volume":"9","author":"He","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/S0167-8191(05)80054-7_bib13","series-title":"Proc. 24th Annual Allerton Conf. on Communication, Control and Computing","first-page":"777","article-title":"Efficient parallel algorithms for solving some tree algorithms","author":"He","year":"1986"},{"issue":"1","key":"10.1016\/S0167-8191(05)80054-7_bib14","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/0205010","article-title":"Bounds for selection","volume":"5","author":"Hyafil","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-8191(05)80054-7_bib15","series-title":"The Art of Computer Programming, Vol. I: Fundamental Algorithms","author":"Knuth","year":"1973"},{"key":"10.1016\/S0167-8191(05)80054-7_bib16","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01840376","article-title":"Efficient parallel algorithms for graph problems","volume":"5","author":"Kruskal","year":"1990","journal-title":"Algorithmica"},{"key":"10.1016\/S0167-8191(05)80054-7_bib17","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/S0167-8191(05)80054-7_bib18","series-title":"Proc. 26th Annual IEEE Symp. on Foundations of Computer Science","first-page":"478","article-title":"Parallel tree construction and its application","author":"Miller","year":"1985"},{"key":"10.1016\/S0167-8191(05)80054-7_bib19","series-title":"Proc. 1987 Internat. Conf. on Parallel Processing","first-page":"204","article-title":"Parallel algorithms for maximum weight matching in trees","author":"Pawagi","year":"1987"},{"key":"10.1016\/S0167-8191(05)80054-7_bib20","series-title":"Proc. 1st ACM Symp. on Parallel Algorithms and Architectures","article-title":"Load balancing, selection and sorting on the hypercube","author":"Plaxton","year":"1989"},{"key":"10.1016\/S0167-8191(05)80054-7_bib21","article-title":"Optimal sorting on a hypercube","author":"Qiu","year":"1989"},{"issue":"2","key":"10.1016\/S0167-8191(05)80054-7_bib22","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0167-8191(90)90151-X","article-title":"Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model","volume":"13","author":"Sheu","year":"1990","journal-title":"Parallel Comput"},{"key":"10.1016\/S0167-8191(05)80054-7_bib23","series-title":"Proc. 25th Annual IEEE Symp. on Foundation of Computer Science IEEE","first-page":"12","article-title":"Finding biocnnected components and computing tree functions in logarithmic parallel time (extended summary)","author":"Tarjan","year":"1984"},{"issue":"2","key":"10.1016\/S0167-8191(05)80054-7_bib24","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819105800547?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819105800547?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T09:21:55Z","timestamp":1548321715000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819105800547"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":24,"journal-issue":{"issue":"6-7","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["S0167819105800547"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(05)80054-7","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}