Three partition refinement algorithms
SIAM Journal on Computing
Theory of 2-structures. Part I: clans, basic subclasses, and morphisms
Theoretical Computer Science
Theory of 2-structures. Part II: representation through labeled tree families
Theoretical Computer Science
P4-trees and substitution decomposition
Discrete Applied Mathematics
Recognizing interval digraphs and interval bigraphs in polynomial time
Discrete Applied Mathematics
Graph classes: a survey
Modular decomposition and transitive orientation
Discrete Mathematics - Special issue on partial ordered sets
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Efficient and practical algorithms for sequential modular decomposition
Journal of Algorithms
Introduction to Algorithms
A New Linear Algorithm for Modular Decomposition
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic aspects of a general modular decomposition theory
Discrete Applied Mathematics
Hi-index | 0.00 |
Modular decomposition of graphs is a powerful tool with many applications in graph theory and optimization. There are efficient linear-time algorithms that compute the decomposition for undirected graphs. The best previously published time bound for directed graphs is O(n + m log n), where n is the number of vertices and m is the number of edges. We give an O(n + m)-time algorithm.