Linear-time modular decomposition of directed graphs

Discrete Applied Mathematics

Volumn 145, Issue 2, 2005, Pages 198-209

  McConnell, Ross M ^a   De Montgolfier, Fabien ^b  

^a Veterinary Dentistry and Oral Surgery   (United States)

^b UNIVERSITÉ PANTHÉON ASSAS   (France)

Author keywords

2 structures; Algorithm; Directed graphs; Modular decomposition; Partitive families; Tournaments; Tree decomposable families

Indexed keywords

ALGORITHMS; COLOR; COMPUTATIONAL METHODS; OPTIMIZATION; PROBLEM SOLVING; RECURSIVE FUNCTIONS;

2-STRUCTURES; DIRECTED GRAPHS; MODULAR DECOMPOSITION; PARTITIVE FAMILIES; TOURNAMENTS; TREE-DECOMPOSABLE FAMILIES;

TREES (MATHEMATICS);

EID: 8344230666     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.02.017     Document Type: Article

References (26)

1. A. Brandstädt, V.B. Le, J. Spinrad, Graph Classes: a Survey, SIAM Monographs on Discrete Mathematics and Applications, Society for Industrial and Applied Mathematics, 1999.
2. C. Capelle, M. Habib, F. de Montgolfier, Graph decomposition, factorizing permutations. Discrete Math. Theoret. Comput. Sci. 5(1) (2002) http://dmtcs.loria.fi/volumes/abstracts/dm050104.abs.htm.
3. M. Chein, M. Habib, M.C. Maurer, Partitive hypergraphs, Discrete Math. 37 (1981) 35-50.
4. T. Cormen, C. Leiserson, R. Rivest, C. Stein, Introduction to Algorithms, MIT Press, Cambridge, MA, 2001.
5. D.G. Cornell, H. Lerchs, L.K. Stewart, Complement reducible graphs, Discrete Appl. Math. 3 (1981) 163-174.
6. A. Cournier, M. Habib, A new linear algorithm for modular decomposition, in: S. Tison (Ed.), Trees in algebra and programming - CAAP 94, 19th International Colloquium, Edinburgh, UK, Lecture Notes in Computer Science, vol. 787, Springer, Berlin, April 1994, pp. 68-84.
7. E. Dahlhaus, Parallel algorithms for hierarchical clustering, and applications to split decomposition and parity graph recognition, J. Algorithms 36 (2) (2000) 205-240.
8. E. Dahlhaus, J. Gustedt, R.M. McCortnen, Efficient and practical algorithms for sequential modular decomposition, J. Algorithms 41 (2) (2001) 360-387.
9. E. Dahlhaus, J. Gustedt, R.M. McConnell, Partially complemented representations of digraphs, Discrete Math. Theoret. Comput. Sci. 5(1) (2002) 147-168.
10. A. Ehrenfeucht, G. Rozenherg, Theory of 2-structures, Part I: clans, basic subclasses and morphisms, Theoret. Comput. Sci. 3 (70) (1990) 277-303.
11. A. Ehrenfeucht, G. Rozenberg, Theory of 2-structures, Part II Representations throught tree labelled families, Theoret. Comput. Sci. 3 (70) (1990) 304-342.
12. 2) divide-and-conquer algorithm for the prime Tree decomposition of 2-structures and the Modular Decomposition of graphs, J. Algorithms 16 (2) (1994) 283-294.
13. T. Gallai, Transitiv orientierbare Graphen, Acta Math. Acad. Sci. Hungar. 18 (1967) 25-66.
14. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
15. 4-tidy graphs, Discrete Math. Theoret. Comput. Sci. 1 (1997) 17-41.
16. M. Habib, Substitution des structures combinatoires, théorie et algorithmes, Thèse d'′Etat, Université Pierre et Marie Curie (Paris VI), 1981.
17. C.T. Hoàng, Perfect Graphs, Ph.D. Thesis, School of Computer Sciences, McGill University, Montreal, 1985.
18. 4-reducible graphs: a class of uniquely tree representable graphs, Stud. Appl. Math. 81 (1989) 79-87.
19. 2) incremental algorithm for modular decomposition of graphs and 2-structures, Algorithmica 14 (1995) 209-227.
20. R.M. McConnell, J. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, in: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, (Arlington, VA), ACM, New York, 1994, pp. 536-545.
21. R.M. McConnell, J. Spinrad, Modular decomposition and transitive orientation, Discrete Math. 201 (1999) 189-241.
22. R.H. Möhring, Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and boolean functions, Ann. Oper. Res. 6 (1985) 195-225.
23. R.H. Möhring, F.J. Radermacher, Substitution decomposition for discrete structures and connections with combinatorial optimization, Ann. Discrete Math. 19 (1984) 257-356.
24. H. Müller, Recognizing interval digraphs and interval bigraphs in polynomial time, Discrete Appl. Math. 78 (1997) 189-205.
25. R. Paige, R.E. Tarjan, Three partition refinement algorithms, SIAM J. Comput. 16 (6) (1987) 973-989.
26. J. Spinrad, P4-trees and substitution decomposition, Discrete Appl. Math. 39 (1992) 263-291.