Affiliation:
1. Univ. of Toronto, Toronto, Ont., Canada
2. Vanderbilt Univ., Nashville, TN
Abstract
Modular decomposition is a form of graph decomposition that has been discovered independently by researchers in graph theory, game theory, network theory, and other areas. This paper reduces the time needed to find the modular decomposition of a graph from Ω(
n
3
) to Ο(
n
2
). Together with a new algorithm for transitive orientation given in [21], this leads to fast new algorithms for a number of problems in graph recognition and isomorphism, including recognition of comparability graphs and permutation graphs. The new algorithm works by inserting each vertex successively into the decomposition tree, using Ο(
n
) time to insert each vertex.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference23 articles.
1. Graphs with unique maximal clumpings;BLASS A;J. Graph Theory,1978
2. A fast algorithm for the decomposition of graphs and posets;BUER H.;Math. Oper. Res.,1983
3. On testing isomorphism of permutation graphs;COLBOURN C.J;Networks
4. A linear recognition algorithm for cographs;CORNEIL D. G.;SIAM J. Comput.,1985
5. CUNNXNGHAM W. Decomposition of directed graphs. SIAM ~ Algorithms and Discrete Meth. 3 (1982) 214-228. CUNNXNGHAM W. Decomposition of directed graphs. SIAM ~ Algorithms and Discrete Meth. 3 (1982) 214-228.
Cited by
82 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献