{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T14:41:46Z","timestamp":1648910506366},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5676,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0012-365x(97)00103-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:25:26Z","timestamp":1049721926000},"page":"289-291","source":"Crossref","is-referenced-by-count":0,"title":["A remark on maximum matching of line graphs"],"prefix":"10.1016","volume":"179","author":[{"given":"Shuji","family":"Shiraishi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00103-9_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02122548","article-title":"A random NC algorithm for depth first search","volume":"8","author":"Aggarwal","year":"1988","journal-title":"Combinatorica"},{"key":"10.1016\/S0012-365X(97)00103-9_BIB2","first-page":"869","article-title":"Parallel algorithms for shared-memory machines","volume":"Vol. A","author":"Karp","year":"1990"},{"key":"10.1016\/S0012-365X(97)00103-9_BIB3","doi-asserted-by":"crossref","unstructured":"R.M. Karp, E. Upfal, A. Wigderson, Constructing a perfect matching is in random NC, Proc. 17th ACM STOC, pp. 22\u201332.","DOI":"10.1145\/22145.22148"},{"key":"10.1016\/S0012-365X(97)00103-9_BIB4","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1007\/BF01759074","article-title":"Chain packing in graphs","volume":"6","author":"Masuyama","year":"1991","journal-title":"Algorithmica"},{"key":"10.1016\/S0012-365X(97)00103-9_BIB5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","article-title":"An O(logn) parallel connectivity algorithm","volume":"3","author":"Shiloach","year":"1982","journal-title":"J. Algorithms"},{"issue":"4","key":"10.1016\/S0012-365X(97)00103-9_BIB6","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97001039?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97001039?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T19:22:40Z","timestamp":1556652160000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97001039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0012365X97001039"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00103-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}