{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T04:28:49Z","timestamp":1787286529690,"version":"build-2736575974"},"reference-count":35,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"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":5221,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1999,4]]},"DOI":"10.1016\/s0012-365x(98)00319-7","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T12:52:26Z","timestamp":1053348746000},"page":"189-241","source":"Crossref","is-referenced-by-count":282,"title":["Modular decomposition and transitive orientation"],"prefix":"10.1016","volume":"201","author":[{"given":"Ross M.","family":"McConnell","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeremy P.","family":"Spinrad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00319-7_BIB1","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 algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0012-365X(98)00319-7_BIB2","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/moor.8.2.170","article-title":"A fast algorithm for the decomposition of graphs and posets","volume":"8","author":"Buer","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0012-365X(98)00319-7_BIB3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0012-365X(81)90138-2","article-title":"Partitive hypergraphs","volume":"37","author":"Chein","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00319-7_BIB4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1002\/net.3230110103","article-title":"On testing isomorphism of permutation graphs","volume":"11","author":"Colbourn","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0012-365X(98)00319-7_BIB5","author":"Cormen","year":"1990"},{"key":"10.1016\/S0012-365X(98)00319-7_BIB6","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\/S0012-365X(98)00319-7_BIB7","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"3","author":"Corneil","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(98)00319-7_BIB8","article-title":"An efficient algorithm to recognize prime undirected graphs","author":"Cournier","year":"1992"},{"key":"10.1016\/S0012-365X(98)00319-7_BIB9","series-title":"CAAP '94: 19th Internat. Coll. Edinburgh, UK","first-page":"68","article-title":"A new linear algorithm for modular decomposition","author":"Cournier","year":"1994"},{"key":"10.1016\/S0012-365X(98)00319-7_BIB10","doi-asserted-by":"crossref","first-page":"600","DOI":"10.2307\/2371374","article-title":"Partially ordered sets","volume":"63","author":"Duschnik","year":"1941","journal-title":"Amer. J. Math."},{"key":"10.1016\/S0012-365X(98)00319-7_BIB11","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1006\/jagm.1994.1013","article-title":"An O(n2) divide-and-conquer algorithm for the prime tree decomposition of two-structures and modular decomposition of graphs","volume":"16","author":"Ehrenfeucht","year":"1994","journal-title":"J. Algorithms"},{"key":"10.1016\/S0012-365X(98)00319-7_BIB12","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(90)90131-Z","article-title":"Primitivity is hereditary for 2-structures","volume":"70","author":"Ehrenfeucht","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0012-365X(98)00319-7_BIB13","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(90)90129-6","article-title":"Theory of 2-structures, part 1: clans, basic subclasses, and morphisms","volume":"70","author":"Ehrenfeucht","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0012-365X(98)00319-7_BIB14","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(90)90130-A","article-title":"Theory of 2-structures, part 2: representations through labeled tree families","volume":"70","author":"Ehrenfeucht","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0012-365X(98)00319-7_BIB15","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","article-title":"A linear-time algorithm for a special case of disjoint set union","volume":"30","author":"Gabow","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0012-365X(98)00319-7_BIB16","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\/S0012-365X(98)00319-7_BIB17","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0095-8956(77)90049-1","article-title":"The complexity of comparability graph recognition and coloring","volume":"22","author":"Golumbic","year":"1977","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(98)00319-7_BIB18","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0012-365X(98)00319-7_BIB19","first-page":"1370","article-title":"Caracterisation des graphes non orient\u00e8s dont on peut orienter les arr\u00eates de mani\u00e8re \u00e0 obtenir le graphe d'une relation d'ordre","volume":"254","author":"Gouil\u00e0-Houri","year":"1962","journal-title":"C. R. Acad. Sci. Paris"},{"key":"10.1016\/S0012-365X(98)00319-7_BIB20","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0166-218X(79)90043-X","article-title":"On the X-join decomposition for undirected graphs","volume":"1","author":"Habib","year":"1979","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(98)00319-7_BIB21","unstructured":"W. Hsu, T. Ma, Fast and simple algorithms for recognizing chordal comparability graphs and interval graphs, manuscript."},{"key":"10.1016\/S0012-365X(98)00319-7_BIB22","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01206330","article-title":"An O(n2) incremental algorithm for modular decomposition of graphs and 2-structures","volume":"14","author":"McConnell","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0012-365X(98)00319-7_BIB23","series-title":"5th Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"536","article-title":"Linear-time modular decomposition and efficient transitive orientation of comparability graphs","author":"McConnell","year":"1994"},{"key":"10.1016\/S0012-365X(98)00319-7_BIB24","series-title":"Graphs and Orders","first-page":"41","article-title":"Algorithmic aspects of comparability graphs and interval graphs","author":"M\u00f6hring","year":"1985"},{"key":"10.1016\/S0012-365X(98)00319-7_BIB25","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF02022041","article-title":"Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functions","volume":"4","author":"M\u00f6hring","year":"1985","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0012-365X(98)00319-7_BIB26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/58562.59300","article-title":"Incremental modular decomposition","volume":"36","author":"Muller","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/S0012-365X(98)00319-7_BIB27","doi-asserted-by":"crossref","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","article-title":"Transitive orientation of graphs and identification of permutation graphs","volume":"23","author":"Pnueli","year":"1971","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0012-365X(98)00319-7_BIB28","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1002\/net.3230120407","article-title":"Circular permutation graphs","volume":"12","author":"Rotem","year":"1982","journal-title":"Networks"},{"key":"10.1016\/S0012-365X(98)00319-7_BIB29","series-title":"Proc. 10th Collo. on Automata, Languages, and Programming","first-page":"676","article-title":"Recognition and Isomorphism of Two-Dimensional Partial Orders","author":"Spinrad","year":"1983"},{"key":"10.1016\/S0012-365X(98)00319-7_BIB30","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1137\/0214048","article-title":"On comparability and permutation graphs","volume":"14","author":"Spinrad","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(98)00319-7_BIB31","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0166-218X(92)90180-I","article-title":"P4 trees and substitution decomposition","volume":"39","author":"Spinrad","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(98)00319-7_BIB32","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1002\/(SICI)1097-0037(199605)27:3<171::AID-NET1>3.0.CO;2-F","article-title":"A linear time algorithm to recognize circular permutation graphs","volume":"27","author":"Sritharan","year":"1996","journal-title":"Networks"},{"key":"10.1016\/S0012-365X(98)00319-7_BIB33","article-title":"Machine scheduling with precedence constraints","author":"Steiner","year":"1982"},{"key":"10.1016\/S0012-365X(98)00319-7_BIB34","doi-asserted-by":"crossref","first-page":"299","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\/S0012-365X(98)00319-7_BIB35","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/0603036","article-title":"The complexity of the partial order dimension problem","volume":"3","author":"Yannakakis","year":"1982","journal-title":"SIAM J. Algebraic Discrete Meth."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98003197?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98003197?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T15:54:57Z","timestamp":1556380497000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98003197"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":35,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0012365X98003197"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00319-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}