{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T06:46:57Z","timestamp":1765176417420},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,10,1]],"date-time":"1988-10-01T00:00:00Z","timestamp":591667200000},"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":9055,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1988,10]]},"DOI":"10.1016\/0304-3975(88)90106-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"33-47","source":"Crossref","is-referenced-by-count":3,"title":["A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs"],"prefix":"10.1016","volume":"61","author":[{"given":"Xin","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90106-5_BIB1","first-page":"468","article-title":"Parallel computational geometry","author":"Aggarwal","year":"1985","journal-title":"Proc. 26th IEEE FOCS"},{"key":"10.1016\/0304-3975(88)90106-5_BIB2","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","article-title":"A fast and simple randomized parallel algorithm for the maximal independent set problem","volume":"7","author":"Alon","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(88)90106-5_BIB3","first-page":"511","article-title":"Parallel merge sort","author":"Cole","year":"1986","journal-title":"Proc. 27th IEEE FOCS"},{"key":"10.1016\/0304-3975(88)90106-5_BIB4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(88)90106-5_BIB5","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1137\/0217028","article-title":"A nearly optimal parallel algorithm for constructing depth-first spanning tree in planar graphs","volume":"17","author":"He","year":"1988","journal-title":"SIAM J. Comput"},{"key":"10.1016\/0304-3975(88)90106-5_BIB6","first-page":"266","article-title":"A fast parallel algorithm for the maximal independent set problem","author":"Karp","year":"1984","journal-title":"Proc. 16th ACM STOC"},{"key":"10.1016\/0304-3975(88)90106-5_BIB7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","article-title":"Optimal search in planar subdivisions","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(88)90106-5_BIB8","first-page":"465","article-title":"An efficient parallel algorithm for planarity","author":"Klein","year":"1986","journal-title":"Proc. 27th IEEE FOCS"},{"key":"10.1016\/0304-3975(88)90106-5_BIB9","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0190(78)90065-0","article-title":"A batching method for coloring a planar graphs","volume":"7","author":"Lipton","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(88)90106-5_BIB10","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."},{"key":"10.1016\/0304-3975(88)90106-5_BIB11","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0022-0000(86)90030-9","article-title":"Finding small simple cycle separator for 2-connected planar graphs","volume":"32","author":"Miller","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(88)90106-5_BIB12","first-page":"478","article-title":"Parallel tree contraction and its applications","author":"Miller","year":"1985","journal-title":"Proc. 26th IEEE FOCS"},{"key":"10.1016\/0304-3975(88)90106-5_BIB13","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"},{"key":"10.1016\/0304-3975(88)90106-5_BIB14","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."},{"key":"10.1016\/0304-3975(88)90106-5_BIB15","first-page":"173","article-title":"Parallel computation","author":"Valiant","year":"1982","journal-title":"Proc. 7th IBM Symp. on Mathematical Foundations of Computer Science"},{"key":"10.1016\/0304-3975(88)90106-5_BIB16","first-page":"315","article-title":"Parallel symmetry-breaking in sparse graphs","author":"Goldberg","year":"1987","journal-title":"Proc. 19th ACM STOC"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901065?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901065?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:54:30Z","timestamp":1555127670000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588901065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,10]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,10]]}},"alternative-id":["0304397588901065"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90106-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,10]]}}}