{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T08:52:23Z","timestamp":1780822343302,"version":"3.54.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"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":4886,"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":[[2000,3]]},"DOI":"10.1016\/s0304-3975(97)00241-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:39:08Z","timestamp":1027629548000},"page":"59-84","source":"Crossref","is-referenced-by-count":169,"title":["Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing"],"prefix":"10.1016","volume":"234","author":[{"given":"Michel","family":"Habib","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ross","family":"McConnell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laurent","family":"Viennot","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00241-7_BIB1","series-title":"Graphes et Hypergraphes","author":"Berge","year":"1970"},{"key":"10.1016\/S0304-3975(97)00241-7_BIB2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs and graph planarity using pq-tree algorithm","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00241-7_BIB3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0166-218X(91)90023-P","article-title":"Classes of bipartite graphs related to chordal graphs","volume":"32","author":"Brandst\u00e4dt","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(97)00241-7_BIB4","first-page":"68","article-title":"A new linear algorithm of modular decomposition","volume":"vol. 787","author":"Cournier","year":"1994"},{"key":"10.1016\/S0304-3975(97)00241-7_BIB5","unstructured":"E. Dahlhaus, J. Gustedt, R.M. McConnell, Efficient and practical modular decomposition, in: Proc. 7th Ann. ACM\u2013SIAM Symp. on Discrete Algorithm, SIAM, Philadelphia, 1997, pp. 26\u201335."},{"key":"10.1016\/S0304-3975(97)00241-7_BIB6","doi-asserted-by":"crossref","unstructured":"P. Galinier, M. Habib, C. Paul, Chordal graphs and their clique graph, in: M. Nagl (Ed.), Graph-Theoretic Concepts in Computer Science, WG\u201995, Lecture Notes in Computer Science, vol. 1017, Aachen, Germany, June 1995, Proc. 21st Internat. Workshop WG\u201995, Springer, Berlin.","DOI":"10.1007\/3-540-60618-1_88"},{"key":"10.1016\/S0304-3975(97)00241-7_BIB7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","article-title":"Transitiv orientierbare graphen","volume":"18","author":"Gallai","year":"1967","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/S0304-3975(97)00241-7_BIB8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","article-title":"The intersection graphs of a path in a tree are exactly the chordal graphs","volume":"16","author":"Gavril","year":"1974","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0304-3975(97)00241-7_BIB9","series-title":"Algorithms Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0304-3975(97)00241-7_BIB10","doi-asserted-by":"crossref","unstructured":"Hsu, Ma, Substitution decomposition on chordal graphs and applications, in: Proc. 2nd ACM-SIGSAM Internat. Symp. on Symbolic Algebraic Comput., Lecture Notes in Computer Science, vol. 557, Springer, Berlin.","DOI":"10.1007\/3-540-54945-5_49"},{"key":"10.1016\/S0304-3975(97)00241-7_BIB11","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1137\/0218005","article-title":"An incremental linear-time algorithm for recognizing interval graphs","volume":"18","author":"Korte","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00241-7_BIB12","unstructured":"R.M. McConnell, J.P. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, in: Proc. 5th Annual ACM\u2013SIAM Symp. on Discrete Algorithms, Arlington, VA, 1994, pp. 536\u2013545."},{"key":"10.1016\/S0304-3975(97)00241-7_BIB13","series-title":"Proc. 7th Annual ACM\u2013SIAM Symp. Discrete Algorithm","first-page":"19","article-title":"Linear-time modular decomposition and efficient transitive orientation of undirected graphs","author":"McConnell","year":"1997"},{"key":"10.1016\/S0304-3975(97)00241-7_BIB14","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","article-title":"Three partition refinement algorithms","volume":"16","author":"Paige","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00241-7_BIB15","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(97)00241-7_BIB16","unstructured":"J.P. Spinrad, Graph partitioning, 1986."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002417?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002417?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T06:28:40Z","timestamp":1555828120000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597002417"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S0304397597002417"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00241-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}