{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T17:25:14Z","timestamp":1762622714461},"reference-count":9,"publisher":"Elsevier BV","issue":"6","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\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1016\/0020-0190(95)00106-m","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:02:51Z","timestamp":1027648971000},"page":"303-307","source":"Crossref","is-referenced-by-count":7,"title":["A fast and efficient NC algorithm for maximal matching"],"prefix":"10.1016","volume":"55","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00106-M_BIB1","series-title":"Proc. 5th IEEE Internat. Parallel Processing Symposium","first-page":"84","article-title":"Optimal EREW parallel algorithms for connectivity, ear decomposition and st-numbering of planar graphs","author":"Gazit","year":"1991"},{"key":"10.1016\/0020-0190(95)00106-M_BIB2","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1137\/0401044","article-title":"Parallel symmetry-breaking in sparse graphs","volume":"1","author":"Goldberg","year":"1988","journal-title":"SIAM J. Disc. Math."},{"key":"10.1016\/0020-0190(95)00106-M_BIB3","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(86)90144-4","article-title":"A fast and simple randomized parallel algorithm for maximal matching","volume":"22","author":"Israeli","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)00106-M_BIB4","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(95)00106-M_BIB5","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/4221.4226","article-title":"A fast parallel algorithm for the maximal independent set problem","volume":"32","author":"Karp","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(95)00106-M_BIB6","first-page":"868","article-title":"Parallel algorithms for shared memory machines","volume":"Vol. A","author":"Karp","year":"1990"},{"key":"10.1016\/0020-0190(95)00106-M_BIB7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0020-0190(94)90130-9","article-title":"An optimal parallel algorithm for maximal matching","volume":"52","author":"Kelsen","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)00106-M_BIB8","series-title":"The Design and Analysis of Algorithms","author":"Kozen","year":"1992"},{"key":"10.1016\/0020-0190(95)00106-M_BIB9","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1137\/0215074","article-title":"A simple parallel algorithm for the maximal independent set problem","volume":"15","author":"Luby","year":"1986","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500106M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500106M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T02:58:32Z","timestamp":1555297112000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909500106M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["002001909500106M"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00106-m","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}