{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:05:47Z","timestamp":1761620747132},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"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":4399,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00234-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"99-111","source":"Crossref","is-referenced-by-count":41,"title":["A simple paradigm for graph recognition: application to cographs and distance hereditary graphs"],"prefix":"10.1016","volume":"263","author":[{"given":"Guillaume","family":"Damiand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Habib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00234-6_BIB1","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","article-title":"Distance hereditary graphs","volume":"41","author":"Bandelt","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(00)00234-6_BIB2","unstructured":"C. Capelle, Decomposition de graphes et permutations factorisantes, Ph.D. Thesis, Universit\u00e9 de Montpellier II, 1996."},{"key":"10.1016\/S0304-3975(00)00234-6_BIB3","unstructured":"D.G. Corneil, S. Olariu, L. Stewart, The ultimate interval graph recognition algorithm? Proc. SODA\u201998, 1998, pp. 175\u2013180 (Extended abstract)."},{"issue":"4","key":"10.1016\/S0304-3975(00)00234-6_BIB4","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\/S0304-3975(00)00234-6_BIB5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0166-218X(93)E0138-O","article-title":"Efficient parallel recognition algorithm for cographs and distance hereditary graphs","volume":"57","author":"Dahlhaus","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(00)00234-6_BIB6","unstructured":"G. Damiand, Quelques propri\u00e9t\u00e9s des graphes distance h\u00e9r\u00e9ditaires, Master's Thesis, Universit\u00e9 de Montpellier II, LIRMM, 1997."},{"key":"10.1016\/S0304-3975(00)00234-6_BIB7","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","article-title":"Lex-bfs and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing","volume":"234","author":"Habib","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00234-6_BIB8","unstructured":"M. Habib, L. Nourine, On some representation for distributed lattices, Technical Report 93042, LIRMM, 1993."},{"key":"10.1016\/S0304-3975(00)00234-6_BIB9","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(90)90131-U","article-title":"Completely separable graphs","volume":"27","author":"Hammer","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(00)00234-6_BIB10","unstructured":"R.M. McConnell, J.P. Spinrad, Linear-time modular decomposition and efficient transitive orientation of undirected graphs, Proc. SODA\u201997, 1997."},{"issue":"2","key":"10.1016\/S0304-3975(00)00234-6_BIB11","doi-asserted-by":"crossref","first-page":"266","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\/S0304-3975(00)00234-6_BIB12","unstructured":"J.P. Spinrad, Open problems, http:\/\/www.vuse.vanderbilt.edu\/spin\/open.html, 1998."},{"key":"10.1016\/S0304-3975(00)00234-6_BIB13","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergaphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002346?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002346?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T10:21:35Z","timestamp":1556792495000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002346"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0304397500002346"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00234-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}