{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T01:16:50Z","timestamp":1648689410969},"reference-count":13,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"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":[[1989,10]]},"DOI":"10.1016\/0020-0190(89)90018-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"277-279","source":"Crossref","is-referenced-by-count":0,"title":["A parallel algorithm for the maximum 2-chain edge packing problem"],"prefix":"10.1016","volume":"32","author":[{"given":"Shuji","family":"Shiraishi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(89)90018-5_BIB1","series-title":"Proc. 19th ACM STOC","first-page":"325","article-title":"A random NC algorithm for depth first search","author":"Aggarwal","year":"1987"},{"key":"10.1016\/0020-0190(89)90018-5_BIB2","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/0022-0000(84)90003-5","article-title":"Finding Euler tour in parallel","volume":"29","author":"Atallah","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(89)90018-5_BIB3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(86)90141-9","article-title":"An improved parallel algorithm for maximal matching","volume":"22","author":"Israeli","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(89)90018-5_BIB4","series-title":"Proc. 17th ACM STOC","first-page":"22","article-title":"Constructing a perfect matching is in random NC","author":"Karp","year":"1985"},{"key":"10.1016\/0020-0190(89)90018-5_BIB5","series-title":"Proc. 16th ACM STOC","first-page":"266","article-title":"A fast parallel algorithm for the maximal independent set problem","author":"Karp","year":"1984"},{"key":"10.1016\/0020-0190(89)90018-5_BIB6","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/0212040","article-title":"On the complexity of general graph factor problems","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(89)90018-5_BIB7","series-title":"Proc. 17th ACM STOC","first-page":"1","article-title":"A simple parallel algorithm for the maximal independent set problem","author":"Luby","year":"1985"},{"key":"10.1016\/0020-0190(89)90018-5_BIB8","series-title":"Technical Report 87014","article-title":"Chain packing in graphs","author":"Masuyama","year":"1987"},{"key":"10.1016\/0020-0190(89)90018-5_BIB9","first-page":"206","article-title":"Graph packing over a rooted tree","volume":"49","author":"Zhang","year":"1987","journal-title":"Memoirs of Faculty of Engineering, Kyoto University"},{"key":"10.1016\/0020-0190(89)90018-5_BIB10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(85)90024-9","article-title":"Depth-first search is inherently sequential","volume":"20","author":"Reif","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(89)90018-5_BIB11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","article-title":"An O(log n) parallel connectivity algorithm","volume":"3","author":"Shiloach","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(89)90018-5_BIB12","first-page":"12","article-title":"Finding biconnected components and computing tree functions in logarithmic parallel time","author":"Tarjan","year":"1984","journal-title":"Proc. 25th IEEE FOCS"},{"key":"10.1016\/0020-0190(89)90018-5_BIB13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0196-6774(83)90033-0","article-title":"Implementation of simultaneous memory address access in models that forbid it","volume":"4","author":"Vishkin","year":"1983","journal-title":"J. Algorithms"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089900185?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089900185?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:57:36Z","timestamp":1555088256000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019089900185"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0020019089900185"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90018-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}