{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:25Z","timestamp":1759638685226},"reference-count":10,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"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":[[1996,9]]},"DOI":"10.1016\/0020-0190(96)00131-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:22:55Z","timestamp":1027624975000},"page":"289-294","source":"Crossref","is-referenced-by-count":4,"title":["Parallel maximum independent set in convex bipartite graphs"],"prefix":"10.1016","volume":"59","author":[{"given":"Artur","family":"Czumaj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Diks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Teresa M.","family":"Przytycka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00131-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\/0020-0190(96)00131-7_BIB2","doi-asserted-by":"crossref","DOI":"10.1006\/jagm.1993.1018","article-title":"Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values","volume":"14","author":"Berkman","year":"1993","journal-title":"J. Algorithms"},{"issue":"3","key":"10.1016\/0020-0190(96)00131-7_BIB3","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/0890-5401(89)90036-9","article-title":"Faster optimal parallel prefix sums and list ranking","volume":"81","author":"Cole","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(96)00131-7_BIB4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-7315(84)90004-2","article-title":"A parallel matching algorithm for convex bipartite graphs and applications to scheduling","volume":"1","author":"Dekel","year":"1984","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0020-0190(96)00131-7_BIB5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","article-title":"A linear-time algorithm for a special case of disjoint set union","volume":"30","author":"Gabow","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(96)00131-7_BIB6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0190(77)90068-0","article-title":"Testing for equality between maximum matching and minimum node covering","volume":"6","author":"Gavril","year":"1977","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(96)00131-7_BIB7","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/nav.3800140304","article-title":"Maximum matching in a convex bipartite graph","volume":"14","author":"Glover","year":"1967","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0020-0190(96)00131-7_BIB8","first-page":"869","article-title":"A survey of parallel algorithms for shared-memory machines","author":"Karp","year":"1990"},{"key":"10.1016\/0020-0190(96)00131-7_BIB9","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF00264533","article-title":"Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems","volume":"15","author":"Lipski","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(96)00131-7_BIB10","series-title":"Proc. 26th IEEE Symp. on Foundations of Computer Science","first-page":"478","article-title":"Parallel tree contraction","author":"Miller","year":"1985"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001317?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001317?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T18:52:52Z","timestamp":1555959172000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096001317"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0020019096001317"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00131-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}