{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T21:28:46Z","timestamp":1676064526468},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1016\/0196-6774(91)90025-t","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T13:03:10Z","timestamp":1099746190000},"page":"96-109","source":"Crossref","is-referenced-by-count":5,"title":["Parallel algorithms for parity graphs"],"prefix":"10.1016","volume":"12","author":[{"given":"T","family":"Przytycka","sequence":"first","affiliation":[]},{"given":"D.G","family":"Corneil","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(91)90025-T_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\/0196-6774(91)90025-T_BIB2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","article-title":"The parallel evaluation of general arithmetic expressions","volume":"21","author":"Brent","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(91)90025-T_BIB3","first-page":"253","article-title":"Parity graphs","volume":"21","author":"Burlet","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0196-6774(91)90025-T_BIB4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Appl. Math."},{"issue":"No. 4","key":"10.1016\/0196-6774(91)90025-T_BIB5","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"14","author":"Corneil","year":"1985","journal-title":"SIAM J. Comput."},{"issue":"No. 8","key":"10.1016\/0196-6774(91)90025-T_BIB6","first-page":"461","article-title":"Computing connected components on parallel computers","volume":"22","author":"Hirschberg","year":"1979","journal-title":"Comm. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(91)90025-T_BIB7_1","article-title":"Parallel Recognition of Cographs and Cotree Construction","author":"Kirkpatrick","year":"1988"},{"key":"10.1016\/0196-6774(91)90025-T_BIB7_2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(90)90083-O","article-title":"Parallel Recognition of Cographs and Cotree Construction","volume":"29","author":"Kirkpatrick","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0196-6774(91)90025-T_BIB8","first-page":"115","article-title":"The graphs whose odd cycles have at least two crossing chords","volume":"21","author":"Meyniel","year":"1984","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/0196-6774(91)90025-T_BIB9","series-title":"Combinatorial Structures and their Applications","first-page":"377","article-title":"On the Berge conjecture concerning perfect graphs","author":"Sachs","year":"1970"},{"key":"10.1016\/0196-6774(91)90025-T_BIB10","series-title":"Proceedings 16th Annual ACM Symp. on Theory of Computing","first-page":"230","article-title":"Randomized speed-up in parallel computation","author":"Vishkin","year":"1984"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749190025T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749190025T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T03:57:26Z","timestamp":1549079846000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667749190025T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["019667749190025T"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(91)90025-t","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}