Linear-time modular decomposition of directed graphs
- 15 January 2005
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 145 (2), 198-209
- https://doi.org/10.1016/j.dam.2004.02.017
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Efficient and Practical Algorithms for Sequential Modular DecompositionJournal of Algorithms, 2001
- Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph RecognitionJournal of Algorithms, 2000
- Recognizing interval digraphs and interval bigraphs in polynomial timeDiscrete Applied Mathematics, 1997
- AnO(n 2) incremental algorithm for modular decomposition of graphs and 2-structuresAlgorithmica, 1995
- An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of GraphsJournal of Algorithms, 1994
- Theory of 2-structures, part I: Clans, basic subclasses, and morphismsTheoretical Computer Science, 1990
- Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functionsAnnals of Operations Research, 1985
- Partitive hypergraphsDiscrete Mathematics, 1981
- Complement reducible graphsDiscrete Applied Mathematics, 1981
- Transitiv orientierbare GraphenActa Mathematica Hungarica, 1967