Recognition and Isomorphism of Two Dimensional Partial Orders
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Two-dimensional partial orders
Two-dimensional partial orders
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Linear-time transitive orientation
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Construction of probe interval models
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The graph sandwich problem for 1-join composition is NP-complete
Discrete Applied Mathematics
On the complexity of the maximum cut problem
Nordic Journal of Computing
A fully dynamic algorithm for modular decomposition and recognition of cographs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Note on the homogeneous set sandwich problem
Information Processing Letters
Fully dynamic recognition algorithm and certificate for directed cograph
Discrete Applied Mathematics
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
Discrete Applied Mathematics
Note on the Homogeneous Set Sandwich Problem
Information Processing Letters
Single machine scheduling with precedence constraints and positionally dependent processing times
Computers and Operations Research
A fully dynamic algorithm for the recognition of P4-sparse graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
A fully dynamic algorithm for the recognition of P4-sparse graphs
Theoretical Computer Science
Survey: A survey of the algorithmic aspects of modular decomposition
Computer Science Review
Scheduling with due date assignment under special conditions on job processing
Journal of Scheduling
| Hi-index | 0.01 |
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;(n3) to &Ogr;(n2). 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;(n) time to insert each vertex.