### Incremental modular decompositionIncremental modular decomposition

Access Restriction
Subscribed

 Author Muller, John H. ♦ Spinrad, Jeremy Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1989 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science 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 $&OHgr;(\textit{n}3)$ to $&Ogr;(\textit{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 $&Ogr;(\textit{n})$ time to insert each vertex. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1989-01-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 36 Issue Number 1 Page Count 19 Starting Page 1 Ending Page 19

#### Open content in new tab

Source: ACM Digital Library