Linear-time modular decomposition of directed graphs

Authors:
Ross M. McConnell;Fabien de Montgolfier
Affiliations:
Colorado State University, Fort Collins, CO 80523-1873, USA;LIAFA, Université Paris 2, 2 place Jussieu, 75005 Paris, France
Venue:
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Year:
2005

Citing 14
Cited 9

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
Introduction to algorithms

Introduction to algorithms
P4-trees and substitution decomposition

Discrete Applied Mathematics
An O(n2) divide-and-conquer algorithm for the prime tree decomposition of two-structures and modular decomposition of graphs

Journal of Algorithms
Recognizing interval digraphs and interval bigraphs in polynomial time

Discrete Applied Mathematics
Graph classes: a survey

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
Parallel algorithms for hierarchical clustering and applications to split decomposition and parity graph recognition

Journal of Algorithms
Efficient and practical algorithms for sequential modular decomposition

Journal of 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)

Structuring acyclic process models

BPM'10 Proceedings of the 8th international conference on Business process management
Kernels for feedback arc set in tournaments

Journal of Computer and System Sciences
Homogeneity vs. adjacency: generalising some graph decomposition algorithms

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Algebraic operations on PQ trees and modular decomposition trees

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Bimodular decomposition of bipartite graphs

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Structuring acyclic process models

Information Systems
A quality aggregation model for service-oriented software product lines based on variability and composition patterns

ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
An iterative approach to synthesize business process templates from compliance rules

Information Systems
On the fixed-parameter tractability of composition-consistent tournament solutions

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One

Quantified Score

Hi-index	0.01

Visualization

Abstract

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+mlogn), where n is the number of vertices and m is the number of edges. We give an O(n+m)-time algorithm.