{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:01Z","timestamp":1725663301430},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_29","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:06:57Z","timestamp":1330204017000},"page":"335-351","source":"Crossref","is-referenced-by-count":2,"title":["Parallel algorithms for cographs recognition and applications"],"prefix":"10.1007","author":[{"given":"Gur Saran","family":"Adhar","sequence":"first","affiliation":[]},{"given":"Shietung","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"29_CR1","series-title":"Technical Report","volume-title":"Combinatorial Problems in Matrix Computations","author":"A. Edenbrandt","year":"1985","unstructured":"A. Edenbrandt. Combinatorial Problems in Matrix Computations. Technical Report, Cornell University, Ithaca, 1985."},{"key":"29_CR2","series-title":"Technical Report","volume-title":"New chracterizations and Algorithmic Studies on Chordal graphs and k-trees","author":"N Chandrasekharan","year":"1985","unstructured":"N Chandrasekharan. New chracterizations and Algorithmic Studies on Chordal graphs and k-trees. Technical Report, School of Automation,IISc, Bangalore,India, 1985."},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D. G. Corneil","year":"1981","unstructured":"D.G. Corneil, H Lerchs, and L.S. Burlingham. Complement reducible graphs. Discrete Applied Mathematics, 3:163\u2013174, 1981.","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"D. G. Corneil","year":"1984","unstructured":"D.G. Corneil and Y Perl. Clustering and domination in perfect graphs. Discrete Applied Mathematics, 9:27\u201339, 1984.","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR5","unstructured":"D.G. Corneil, Y Perl, and L.K. Stewart. Cographs: recognition, applications and algorithms. In Proc. 15th Southeastern Conference on Combinatorics, Graph Theory and Computing, 1984."},{"issue":"4","key":"29_CR6","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D. G. Corneil","year":"1985","unstructured":"D.G. Corneil, Y Perl, and L.K. Stewart. A linear recognition algorithm for cographs. SIAM J. COMP., 14(4):926\u2013934, 1985.","journal-title":"SIAM J. COMP."},{"key":"29_CR7","unstructured":"Joan Feigenbaum. Product graphs:some algorithms and combinatorial results. Technical Report, Stanford University, 1986."},{"key":"29_CR8","unstructured":"David Helmbold and Ernst Mayr. Perfect graphs and parallel algorithms. In Proc. of 1986 Intl.Conf.on Parallel Processing, 1986."},{"key":"29_CR9","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"Donald J. J. Rose","year":"1970","unstructured":"Donald J. Rose. Triangualated graphs and the elimination process. Journal of Mathematical analysis and applications, 32:597\u2013609, 1970.","journal-title":"Journal of Mathematical analysis and applications"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Donald J.Rose, R.Endre Tarjan, and George S.Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM J. COMP., 5(2), June 1976.","DOI":"10.1137\/0205021"},{"key":"29_CR11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0095-8956(78)90013-8","volume":"24","author":"H. A. Jung","year":"1978","unstructured":"H.A. Jung. On a class of posets and the coresponding comparability graphs. Journal of Combinatorial Theory, 24:125\u2013133, 1978.","journal-title":"Journal of Combinatorial Theory"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Philip N. Klein. Efficient parallel algorithms for chordal graphs. FOCS 88, 1988.","DOI":"10.1109\/SFCS.1988.21933"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Gary L.Miller and John H.Reif. Parallel tree contraction and its application. In Proc. of 26th FOCS, pages 478\u2013489, 1985.","DOI":"10.1109\/SFCS.1985.43"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"M.C.Golumbic. Algorithmic Graph Theory and Perfect Garphs. Academic Press, 1980.","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Joseph Naor, Moni Naor, and Alejandro A.Schaffer. Fast parallel algorithms for chordal graphs. ACM Symposium on theory of computing, 354\u2013364, 1987.","DOI":"10.1145\/28395.28433"},{"key":"29_CR16","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0166-218X(84)90008-8","volume":"7","author":"D. R. Shier","year":"1984","unstructured":"D.R. Shier. Some aspects of perfect elimination orderings in chordal graphs. Discrete Applied Mathematics, 7:325\u2013331, 1984.","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR17","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1017\/S1446788700029232","volume":"18","author":"D. P. Sumner","year":"1974","unstructured":"D.P. Sumner. Dacey graphs. Journal of Aust. Math. Soc., 18:492\u2013502, 1974.","journal-title":"Journal of Aust. Math. Soc."},{"key":"29_CR18","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y. Shiloach","year":"1982","unstructured":"Yossi Shiloach and Uzi Vishkin. An o(log n) parallel connectivity algorithm. Journal of Algorithms., 3:57\u201367, 1982.","journal-title":"Journal of Algorithms."},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Robert E. Tarjan. Garph Theory and Gaussian Elimination. Technical Report, Stanford University, 1975.","DOI":"10.1016\/B978-0-12-141050-6.50006-4"},{"key":"29_CR20","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R. Tarjan","year":"1984","unstructured":"R. Tarjan and M. Yannakakis. Simple linear algorithms to test the chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs. SIAM J. COMP., 13:566\u2013579, 1984.","journal-title":"SIAM J. COMP."},{"issue":"2","key":"29_CR21","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"Jacobo Valdes, R.E. Tarjan, and E.L. Lawler. The recognition of series parallel digraphs. SIAM J. COMP., 11(2):298\u2013313, 1982.","journal-title":"SIAM J. COMP."},{"key":"29_CR22","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M. Yannakakis","year":"1981","unstructured":"Mihalis Yannakakis. Computing the minimum fill-in is np-complete. SIAM J. ALGEBRIC and DISC. MATH., 2:77\u201379, 1981.","journal-title":"SIAM J. ALGEBRIC and DISC. MATH."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:21:55Z","timestamp":1605648115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}