{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:57:01Z","timestamp":1760245021315,"version":"3.44.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1016\/0743-7315(91)90111-l","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"76-90","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"title":["An NC recognition algorithm for cographs"],"prefix":"10.1016","volume":"13","author":[{"given":"R.","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Olariu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(91)90111-L_BIB1","series-title":"Proc. 1989 Workshop on Algorithms and Data Structures","first-page":"335","article-title":"Parallel algorithms for cograph recognition and applications","author":"Adhar","year":"1989"},{"year":"1976","series-title":"Graph Theory with Applications","author":"Bondy","key":"10.1016\/0743-7315(91)90111-L_BIB2"},{"key":"10.1016\/0743-7315(91)90111-L_BIB3","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0743-7315(91)90111-L_BIB4","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1137\/0217009","article-title":"Approximate parallel scheduling. l. The basic techniques with applications to optimal parallel list ranking in logarithmic time","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0743-7315(91)90111-L_BIB5","first-page":"237","article-title":"Families of recursively defined perfect graphs","volume":"39","author":"Corneil","year":"1983","journal-title":"Cong. Numer."},{"key":"10.1016\/0743-7315(91)90111-L_BIB6","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."},{"key":"10.1016\/0743-7315(91)90111-L_BIB7","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."},{"key":"10.1016\/0743-7315(91)90111-L_BIB8","first-page":"480","article-title":"Binary trees and parallel scheduling algorithms","author":"Dekel","year":"1981"},{"article-title":"Combinatorial problems in matrix computation","year":"1985","author":"Edenbrandt","key":"10.1016\/0743-7315(91)90111-L_BIB9"},{"key":"10.1016\/0743-7315(91)90111-L_BIB10","series-title":"Proc. IEEE International Conference on Parallel Processing","first-page":"853","article-title":"Perfect graphs and parallel algorithms","author":"Helmbold","year":"1986"},{"key":"10.1016\/0743-7315(91)90111-L_BIB11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0095-8956(78)90013-8","article-title":"On a class of posets and the corresponding comparability graphs","volume":"24","author":"Jung","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0743-7315(91)90111-L_BIB12","unstructured":"Kirkpatrick, D. G., and Przytycka, T. Parallel recognition of cographs and cotree construction. The University of British Columbia, Tech. Rep. 1\u201388; Discrete Appl. Math., to apear."},{"key":"10.1016\/0743-7315(91)90111-L_BIB13","series-title":"Proc. 5th Conference of FST and TCS","first-page":"496","article-title":"NC algorithms for comparability graphs, interval graphs and testing the unique perfect matching","author":"Kozen","year":"1985"},{"year":"1971","series-title":"On cliques and kernel","author":"Lerchs","key":"10.1016\/0743-7315(91)90111-L_BIB14"},{"year":"1972","series-title":"On the clique-kernel structure of graphs","author":"Lerchs","key":"10.1016\/0743-7315(91)90111-L_BIB15"},{"key":"10.1016\/0743-7315(91)90111-L_BIB16","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/321879.321882","article-title":"Bounds to complexities of networks for sorting and switching","volume":"22","author":"Muller","year":"1975","journal-title":"JACM"},{"key":"10.1016\/0743-7315(91)90111-L_BIB17","series-title":"Proc. Symposium on Theory of Computing","first-page":"355","article-title":"Fast parallel algorithms for chordal graphs","author":"Naor","year":"1985"},{"key":"10.1016\/0743-7315(91)90111-L_BIB18","unstructured":"Novick, M. Fast parallel algorithms for modular decomposition. Cornell University, Tech. Rep. TR 89\u20131016"},{"key":"10.1016\/0743-7315(91)90111-L_BIB19","article-title":"New parallel sorting schemes","volume":"27","author":"Preparata","year":"1978","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90111-L_BIB20","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/2514.2515","article-title":"Parallel graph algorithms","volume":"16","author":"Quinn","year":"1984","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0743-7315(91)90111-L_BIB21","series-title":"Proc. 20th IEEE Symposium on Foundations of Computer Science","article-title":"On simultaneous resource bounds","author":"Pippenger","year":"1979"},{"article-title":"Parallel algorithms for graph-theoretic problems","year":"1977","author":"Savage","key":"10.1016\/0743-7315(91)90111-L_BIB22"},{"key":"10.1016\/0743-7315(91)90111-L_BIB23","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0095-8956(74)90063-X","article-title":"On a property of the class of n-colorable graphs","volume":"16","author":"Seinsche","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0743-7315(91)90111-L_BIB24","series-title":"French-Israeli Conference on Comb. and Algorithms","article-title":"A fast algorithm for cographs","author":"Shyu","year":"1988"},{"article-title":"Cographs, a class of tree representable graphs","year":"1978","author":"Stewart","key":"10.1016\/0743-7315(91)90111-L_BIB25"},{"key":"10.1016\/0743-7315(91)90111-L_BIB26","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","article-title":"An O(log n) parallel connectivity algorithm","volume":"3","author":"Shiloah","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0743-7315(91)90111-L_BIB27","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1017\/S1446788700029232","article-title":"Dacey graphs","volume":"18","author":"Sumner","year":"1974","journal-title":"J. Austral. Math. Soc."},{"article-title":"Synchronous parallel computation\u2014a survey","year":"1983","author":"Vishkin","key":"10.1016\/0743-7315(91)90111-L_BIB28"},{"key":"10.1016\/0743-7315(91)90111-L_BIB29","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0196-6774(83)90033-0","article-title":"Implementation of simultaneous memory address access in models that forbid it","volume":"4","author":"Vishkin","year":"1983","journal-title":"J. Algorithms"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190111L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190111L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:29:45Z","timestamp":1757514585000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159190111L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["074373159190111L"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(91)90111-l","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1991,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An NC recognition algorithm for cographs","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(91)90111-L","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}