A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
[chapter]
2008
Lecture Notes in Computer Science
Modular decomposition is fundamental for many important problems in algorithmic graph theory including transitive orientation, the recognition of several classes of graphs, and certain combinatorial optimization problems. Accordingly, there has been a drive towards a practical, linear-time algorithm for the problem. This paper posits such an algorithm; we present a linear-time modular decomposition algorithm that proceeds in four straightforward steps. This is achieved by introducing the notion
doi:10.1007/978-3-540-70575-8_52
fatcat:xehsdbkcvbezncnedfodbfub44