{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T06:46:59Z","timestamp":1765176419714},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"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":8478,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1016\/0166-218x(90)90130-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"69-83","source":"Crossref","is-referenced-by-count":4,"title":["Parallel algorithms for fractional and maximal independent sets in planar graphs"],"prefix":"10.1016","volume":"27","author":[{"given":"N.","family":"Dadoun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.G.","family":"Kirkpatrick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90130-5_BIB1","series-title":"Tech. Rept. 87-14","article-title":"A simple optimal randomized parallel list ranking algorithm","author":"Abrahamson","year":"1987"},{"key":"10.1016\/0166-218X(90)90130-5_BIB2","first-page":"206","article-title":"Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms","author":"Cole","year":"1986","journal-title":"18th ACM Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(90)90130-5_BIB3","first-page":"205","article-title":"Parallel processing for efficient subdivision search","author":"Dadoun","year":"1987","journal-title":"3rd ACM Symposium on Computational Geometry"},{"issue":"2","key":"10.1016\/0166-218X(90)90130-5_BIB4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0022-0000(89)90042-1","article-title":"Parallel construction of subdivision hierarchies","volume":"39","author":"Dadoun","year":"1989","journal-title":"J. Comput. Systems Sci."},{"issue":"2","key":"10.1016\/0166-218X(90)90130-5_BIB5","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1145\/357337.357338","article-title":"A new point-location algorithm and its practical efficiency\u2014comparison with existing algorithms","volume":"3","author":"Edahiro","year":"1984","journal-title":"ACM Trans. Graphics"},{"key":"10.1016\/0166-218X(90)90130-5_BIB6","first-page":"315","article-title":"Parallel symmetry-breaking in sparse graphs","author":"Goldberg","year":"1987","journal-title":"19th ACM Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(90)90130-5_BIB7","first-page":"161","article-title":"A new parallel algorithm for the maximal independent set problem","author":"Goldberg","year":"1987","journal-title":"28th IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0166-218X(90)90130-5_BIB8","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/3-540-18088-5_25","article-title":"Parallel 5-colouring of planar graphs","author":"Hagerup","year":"1987","journal-title":"14th International Colloquium on Automata, Languages and Programming"},{"key":"10.1016\/0166-218X(90)90130-5_BIB9","author":"Hagerup","year":"1987","journal-title":"Optimal parallel 5-colouring of planar graphs (expanded version)"},{"key":"10.1016\/0166-218X(90)90130-5_BIB10","author":"Jung","year":"1987","journal-title":"Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees"},{"key":"10.1016\/0166-218X(90)90130-5_BIB11","first-page":"266","article-title":"A fast parallel algorithm for the maximal independent set problem","author":"Karp","year":"1984","journal-title":"16th ACM Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(90)90130-5_BIB12","first-page":"1","article-title":"A simple parallel algorithm for the maximal independent set problem","author":"Luby","year":"1985","journal-title":"17th ACM Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(90)90130-5_BIB13","first-page":"478","article-title":"Parallel tree contraction and its application","author":"Miller","year":"1985","journal-title":"26th IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0166-218X(90)90130-5_BIB14","series-title":"The Analysis of Algorithms","author":"Purdom","year":"1985"},{"key":"10.1016\/0166-218X(90)90130-5_BIB15","first-page":"230","article-title":"Randomized speed-ups in parallel computation","author":"Vishkin","year":"1984","journal-title":"16th ACM Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(90)90130-5_BIB16","series-title":"Tech. Rept. TR 79\u2013387","article-title":"The complexity of parallel computation","author":"Wyllie","year":"1979"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X90901305?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X90901305?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:56:56Z","timestamp":1555120616000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X90901305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["0166218X90901305"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90130-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}