{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:56:54Z","timestamp":1760245014723},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"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":8294,"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,11]]},"DOI":"10.1016\/0166-218x(90)90083-o","type":"journal-article","created":{"date-parts":[[2002,7,28]],"date-time":"2002-07-28T16:40:59Z","timestamp":1027874459000},"page":"79-96","source":"Crossref","is-referenced-by-count":6,"title":["Parallel recognition of complement reducible graphs and cotree construction"],"prefix":"10.1016","volume":"29","author":[{"given":"D.G.","family":"Kirkpatrick","sequence":"first","affiliation":[]},{"given":"T.","family":"Przytycka","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90083-O_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\/0166-218X(90)90083-O_BIB2","first-page":"81","article-title":"Deterministic parallel list ranking, VLSI algorithms and architecture","author":"Anderson","year":"1988","journal-title":"3rd Agean Workshop on Computing"},{"issue":"2","key":"10.1016\/0166-218X(90)90083-O_BIB3","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. ACM"},{"key":"10.1016\/0166-218X(90)90083-O_BIB4","first-page":"253","article-title":"Parity graphs","volume":"21","author":"Burlet","year":"1984"},{"key":"10.1016\/0166-218X(90)90083-O_BIB5","first-page":"478","article-title":"Approximate and exact parallel scheduling with applications to list, tree and graph problems","author":"Cole","year":"1986","journal-title":"Proceedings 27th Annual IEEE Symposium on Foundations of Computer Science"},{"issue":"3","key":"10.1016\/0166-218X(90)90083-O_BIB6","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01762121","article-title":"The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time","volume":"3","author":"Cole","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0166-218X(90)90083-O_BIB7","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":"4","key":"10.1016\/0166-218X(90)90083-O_BIB8","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\/0166-218X(90)90083-O_BIB9","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/3-540-17179-7_28","article-title":"An optimal parallel algorithm for dynamic tree expression evaluation and its applications","author":"Gibbons","year":"1986","journal-title":"Proceedings Symposium on Foundations of Software Technology and Theoretical Computer Science"},{"key":"10.1016\/0166-218X(90)90083-O_BIB10","first-page":"777","article-title":"Efficient parallel algorithms for solving some tree problems","author":"He","year":"1986","journal-title":"Proceedings 24th Allerton Conference on Communication, Control and Computing"},{"key":"10.1016\/0166-218X(90)90083-O_BIB11","series-title":"Computer & Information Science Research Center Tech. Rept.","article-title":"Parallel recognition and decomposition of two terminal series parallel graphs","author":"He","year":"1986"},{"issue":"8","key":"10.1016\/0166-218X(90)90083-O_BIB12","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/359138.359141","article-title":"Computing connected components on parallel computers","volume":"22","author":"Hirschberg","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-218X(90)90083-O_BIB13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0095-8956(78)90013-8","article-title":"On a class of posets and corresponding comparability graphs","volume":"24","author":"Jung","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(90)90083-O_BIB14","series-title":"Rept. UCB\/CSD 88\/408","article-title":"A survey of parallel algorithms for shared-memory machines","author":"Karp","year":"1988"},{"key":"10.1016\/0166-218X(90)90083-O_BIB15","series-title":"Department of Computer Science Tech. Rept.","article-title":"On cliques and kernels","author":"Lerchs","year":"1971"},{"key":"10.1016\/0166-218X(90)90083-O_BIB16","series-title":"Department of Computer Science Tech. Rept.","article-title":"On the clique-kernel structure of graphs","author":"Lerchs","year":"1972"},{"key":"10.1016\/0166-218X(90)90083-O_BIB17","first-page":"478","article-title":"Parallel tree contraction and its application","author":"Miller","year":"1985","journal-title":"Proceedings 26th IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0166-218X(90)90083-O_BIB18","first-page":"355","article-title":"Fast parallel algorithms for chordal graphs","author":"Naor","year":"1987","journal-title":"Proceedings 19th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(90)90083-O_BIB19","series-title":"M.Sc. Thesis","article-title":"Cographs, a class of tree representable graphs","author":"Stewart","year":"1978"},{"issue":"4","key":"10.1016\/0166-218X(90)90083-O_BIB20","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."},{"key":"10.1016\/0166-218X(90)90083-O_BIB21","first-page":"230","article-title":"Randomized speed-ups in parallel computation","author":"Vishkin","year":"1984","journal-title":"Proceedings 16th Annual ACM Symposium on Theory of Computing"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090083O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090083O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T03:23:43Z","timestamp":1554953023000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090083O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["0166218X9090083O"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90083-o","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}