Efficient and Practical Algorithms for Sequential Modular Decomposition
- 30 November 2001
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 41 (2) , 360-387
- https://doi.org/10.1006/jagm.2001.1185
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- A new linear algorithm for Modular DecompositionPublished by Springer Nature ,2005
- Efficient union-find for planar graphs and other sparse graph classesTheoretical Computer Science, 1998
- An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of GraphsJournal of Algorithms, 1994
- On some complexity properties of N-free posets and posets with bounded decomposition diameterDiscrete Mathematics, 1987
- A Linear Recognition Algorithm for CographsSIAM Journal on Computing, 1985
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- A Fast Algorithm for the Decomposition of Graphs and PosetsMathematics of Operations Research, 1983
- On the X-join decomposition for undirected graphsDiscrete Applied Mathematics, 1979
- Comparability graphs and a new matroidJournal of Combinatorial Theory, Series B, 1977
- Transitiv orientierbare GraphenActa Mathematica Hungarica, 1967