HIGHLIGHTS
- who: Graph algorithms and colleagues from the 61, rue Ada, , Montpellier , France have published the Article: Graph Decompositions and Factorizing Permutations, in the Journal: (JOURNAL) of Jul/16,/1998
- what: It is applied here for modular decomposition of directed graphs and the authors propose a simple linear algorithm that computes the whole decomposition tree when a factorizing permutation is provided. This work has been generalized to modular decomposition with an O(n + m log n) algorithm for undirected graphs.
- future: As a consequence such an algorithm and the notion of factorizing permutation introduce . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.