Modular decomposition and transitive orientation

Discrete Mathematics

Volumn 201, Issue 1-3, 1999, Pages 189-241

  McConnell, Ross M ^a   Spinrad, Jeremy P ^b  

^a The University of Colorado Denver   (United States)

^b VANDERBILT UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000848263     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00319-7     Document Type: Article

References (35)

1. S. Booth, S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. System Sci. 13 (1976) 335-379.
2. B. Buer, R.H. Möhring, A fast algorithm for the decomposition of graphs and posets, Math. Oper. Res. 8 (1983) 170-184.
3. M. Chein, M. Habib, M.C. Maurer, Partitive hypergraphs, Discrete Math. 37 (1981) 35-50.
4. C.J. Colbourn, On testing isomorphism of permutation graphs, Networks 11 (1981) 13-21.
5. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Algorithms, MIT Press, Cambridge, MA 1990.
6. D.G. Corneil, H. Lerchs, L.S. Burlingham, Complement reducible graphs, Discrete Appl. Math. 3 (1981) 163-174.
7. D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput. 3 (1985) 926-934.
8. A. Cournier, M. Habib, An efficient algorithm to recognize prime undirected graphs, Technical Report R.R. LIRMM 92-023, Laboratoire D'Informatique, de Robotique et de Microelectronique de Montpellier, 1992.
9. A. Cournier, M. Habib, A new linear algorithm for modular decomposition, in: S. Tison (Ed.), CAAP '94: 19th Internat. Coll. Edinburgh, UK, Lecture Notes in Computer Science, Springer, Berlin, 1994, pp 68-82.
10. B. Duschnik, E.W. Miller, Partially ordered sets, Amer. J. Math. 63 (1941) 600-610.
11. 2) divide-and-conquer algorithm for the prime tree decomposition of two-structures and modular decomposition of graphs, J. Algorithms 16 (1994) 283-294.
12. A. Ehrenfeucht, G. Rozenberg, Primitivity is hereditary for 2-structures, Theoret. Comput. Sci. 70 (1990) 343-358.
13. A. Ehrenfeucht, G. Rozenberg, Theory of 2-structures, part 1: clans, basic subclasses, and morphisms, Theoret. Comput. Sci. 70 (1990) 277-303.
14. A. Ehrenfeucht, G. Rozenberg, Theory of 2-structures, part 2: representations through labeled tree families, Theoret. Comput. Sci. 70 (1990) 305-342.
15. H.N. Gabow, R.E. Tarjan, A linear-time algorithm for a special case of disjoint set union, J. Comput. System Sci. 30 (1985) 209-221.
16. T. Gallai, Transitiv orientierbare graphen, Acta Math. Acad. Sci. Hungar. 18 (1967) 25-66.
17. M.C. Golumbic, The complexity of comparability graph recognition and coloring, J. Combin. Theory Ser. B 22 (1977) 68-90.
18. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
19. A. Gouilà-Houri, Caracterisation des graphes non orientès dont on peut orienter les arrêtes de manière à obtenir le graphe d'une relation d'ordre, C. R. Acad. Sci. Paris 254 (1962) 1370-1371.
20. M. Habib, M.C. Maurer, On the X-join decomposition for undirected graphs, Discrete Appl. Math. 1 (1979) 201-207.
21. W. Hsu, T. Ma, Fast and simple algorithms for recognizing chordal comparability graphs and interval graphs, manuscript.
22. 2) incremental algorithm for modular decomposition of graphs and 2-structures, Algorithmica 14 (1995) 229-248.
23. R.M. McConnell, J.P. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, 5th Ann. ACM-SIAM Symp. on Discrete Algorithms, Arlington, Virginia, 1994, pp 536-545.
24. R.H. Möhring, Algorithmic aspects of comparability graphs and interval graphs, in: I. Rival (Ed.), Graphs and Orders, D. Reidel, Boston, 1985, 41-101.
25. R.H. Möhring, Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functions, Ann. Oper. Res. 4 (1985/6) 195-225.
26. J.H. Muller, J. Spinrad, Incremental modular decomposition, J. ACM 36 (1989) 1-19.
27. A. Pnueli, A. Lempel, S. Even, Transitive orientation of graphs and identification of permutation graphs, Canad. J. Math. 23 (1971) 160-175.
28. D. Rotem, J. Urrutia, Circular permutation graphs, Networks 12 (1982) 429-437.
29. J. Spinrad, J. Valdes, Recognition and Isomorphism of Two-Dimensional Partial Orders, Proc. 10th Collo. on Automata, Languages, and Programming, Lecture Notes in Computer Science, Springer, Berlin, 1983, 676-686.
30. J.P. Spinrad, On comparability and permutation graphs, SIAM J. Comput. 14 (1985) 658-670.
31. 4 trees and substitution decomposition, Discrete Appl. Math. 39 (1992) 263-291.
32. R. Sritharan, A linear time algorithm to recognize circular permutation graphs, Networks 27 (1996) 171-174.
33. G. Steiner, Machine scheduling with precedence constraints, Ph.D. Thesis, University of Waterloo, Waterloo, Ont., 1982.
34. J. Valdes, R.E. Tarjan, E.L. Lawler, The recognition of series-parallel digraphs, SIAM J. Comput. 11 (1982) 299-313.
35. M. Yannakakis, The complexity of the partial order dimension problem, SIAM J. Algebraic Discrete Meth. 3 (1982) 303-322.