{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:56:56Z","timestamp":1760245016831},"reference-count":33,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"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":[[1990,6]]},"DOI":"10.1016\/0196-6774(90)90006-z","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"252-284","source":"Crossref","is-referenced-by-count":14,"title":["Parallel algorithms for cographs and parity graphs with applications"],"prefix":"10.1016","volume":"11","author":[{"given":"Gur Saran","family":"Adhar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shietung","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(90)90006-Z_BIB1","series-title":"Proceedings of International Conference on Computing and Information (ICCI'89)","article-title":"NC algorithms for complement reducible graphs and parity graphs","author":"Adhar","year":"1989"},{"key":"10.1016\/0196-6774(90)90006-Z_BIB2","series-title":"Workshop on Algorithms and Data Structures","article-title":"Parallel algorithms for complement reducible graphs and parity graphs with applications","author":"Adhar","year":"1989"},{"key":"10.1016\/0196-6774(90)90006-Z_BIB3","series-title":"Technical Report","article-title":"Parallel Algorithms for Finding Minimal Path Cover, Hamiltonian Path, and Hamiltonian Cycle in Cographs","author":"Adhar","year":"1989"},{"key":"10.1016\/0196-6774(90)90006-Z_BIB4","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0196-6774(90)90006-Z_BIB5","first-page":"253","article-title":"Parity graphs","volume":"21","author":"Burlet","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0196-6774(90)90006-Z_BIB6","series-title":"Technical Report","article-title":"New characterizations and Algorithmic Studies on Chordal Graphs and k-trees","author":"Chandrasekharan","year":"1985"},{"key":"10.1016\/0196-6774(90)90006-Z_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."},{"key":"10.1016\/0196-6774(90)90006-Z_BIB8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","article-title":"Clustering and domination in perfect graphs","volume":"9","author":"Corneil","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0196-6774(90)90006-Z_BIB9","series-title":"Proceedings 15th Southeastern Conference on Combinatorics, Graph Theory and Computing","article-title":"Cographs: Recognition, applications, and algorithms","author":"Corneil","year":"1984"},{"issue":"No. 4","key":"10.1016\/0196-6774(90)90006-Z_BIB10","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\/0196-6774(90)90006-Z_BIB11","series-title":"Technical Report","article-title":"Combinatorial Problems in Matrix Computations","author":"Edenbrandt","year":"1985"},{"key":"10.1016\/0196-6774(90)90006-Z_BIB12","series-title":"Technical Report","article-title":"Product Graphs: Some Algorithms and Combinatorial Results","author":"Feigenbaum","year":"1986"},{"key":"10.1016\/0196-6774(90)90006-Z_BIB13","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0012-365X(77)90030-9","article-title":"Algorithms on clique separable graphs","volume":"17","author":"Gavril","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/0196-6774(90)90006-Z_BIB14","series-title":"Computers and Interactability","author":"Garey","year":"1979"},{"key":"10.1016\/0196-6774(90)90006-Z_BIB15","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0196-6774(90)90006-Z_BIB16","series-title":"ACM Symposium on Theory of Computing","first-page":"55","article-title":"Parallel algorithm for transitive closure and the connected component problems","author":"Hirschberg","year":"1976"},{"key":"10.1016\/0196-6774(90)90006-Z_BIB17","series-title":"Proceedings, 1986 Intl. Conf. on Parallel Processing","article-title":"Perfect graphs and parallel algorithms","author":"Helmbold","year":"1986"},{"key":"10.1016\/0196-6774(90)90006-Z_BIB18","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","article-title":"Triangulated graphs and the elimination process","volume":"32","author":"Rose","year":"1970","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/0196-6774(90)90006-Z_BIB19","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"},{"key":"10.1016\/0196-6774(90)90006-Z_BIB20","series-title":"IEEE Found. of Comput. Sci.","article-title":"Efficient parallel algorithms for chordal graphs","author":"Klein","year":"1988"},{"key":"10.1016\/0196-6774(90)90006-Z_BIB21","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0012-365X(76)80008-8","article-title":"On the perfect graph conjecture","volume":"16","author":"Meyniel","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0196-6774(90)90006-Z_BIB22","series-title":"Proceedings 26th Found. of Comput. Sci.","first-page":"478","article-title":"Parallel tree contraction and its application","author":"Miller","year":"1985"},{"key":"10.1016\/0196-6774(90)90006-Z_BIB23","series-title":"ACM Symposium on Theory of Computing","first-page":"354","article-title":"Fast parallel algorithms for chordal graphs","author":"Naor","year":"1987"},{"issue":"No. 9","key":"10.1016\/0196-6774(90)90006-Z_BIB24","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1137\/0210028","article-title":"Recursive graphs, recursive labelings and shortest paths","volume":"10","author":"Proskurowski","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(90)90006-Z_BIB25","first-page":"145","article-title":"Meyniel graphs are strongly perfect","volume":"21","author":"Ravindra","year":"1984","journal-title":"Ann. Discrete Math."},{"issue":"No. 2","key":"10.1016\/0196-6774(90)90006-Z_BIB26","doi-asserted-by":"crossref","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects of vertex elimination on graphs","volume":"5","author":"Rose","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(90)90006-Z_BIB27","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0166-218X(84)90008-8","article-title":"Some aspects of perfect elimination orderings in chordal graphs","volume":"7","author":"Shier","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0196-6774(90)90006-Z_BIB28","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\/0196-6774(90)90006-Z_BIB29","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":"Shiloach","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(90)90006-Z_BIB30","series-title":"Technical Report","article-title":"Graph Theory and Gaussian Elimination","author":"Tarjan","year":"1975"},{"key":"10.1016\/0196-6774(90)90006-Z_BIB31","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear algorithms to test the chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"issue":"No. 2","key":"10.1016\/0196-6774(90)90006-Z_BIB32","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series parallel digraphs","volume":"11","author":"Valdes","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(90)90006-Z_BIB33","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0602010","article-title":"Computing the minimum fill-in is NP-complete","volume":"2","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Algebraic Discrete Math."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749090006Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749090006Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:54:07Z","timestamp":1548726847000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667749090006Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["019667749090006Z"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(90)90006-z","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}