Sciweavers

DAM
2006
97views more  DAM 2006»
14 years 2 months ago
Fully dynamic recognition algorithm and certificate for directed cographs
This paper presents an optimal fully dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc ...
Christophe Crespelle, Christophe Paul
WG
1995
Springer
14 years 6 months ago
Modular Decomposition of Hypergraphs
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...
Paola Bonizzoni, Gianluca Della Vedova
GD
2005
Springer
14 years 8 months ago
Drawing Graphs Using Modular Decomposition
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
Charis Papadopoulos, Constantinos Voglis