Fully Dynamic Recognition Algorithm and Certificate for Directed Cographs

Christophe Crespelle 1 Christophe Paul 2
1 DANTE - Dynamic Networks : Temporal and Structural Capture Approach
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme, IXXI - Institut Rhône-Alpin des systèmes complexes
2 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : 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 and vertex modification (insertion or deletion) in O(d) time where d is the number of arcs involved in the operation. Moreover, if the modified graph remains a directed cograph, the modular decomposition tree is updated; otherwise, a certificate is returned within the same complexity.
Document type :
Journal articles
Complete list of metadatas

Contributor : Christophe Crespelle <>
Submitted on : Monday, January 2, 2017 - 12:16:38 PM
Last modification on : Thursday, February 7, 2019 - 2:52:51 PM

Links full text



Christophe Crespelle, Christophe Paul. Fully Dynamic Recognition Algorithm and Certificate for Directed Cographs. Discrete Applied Mathematics, Elsevier, 2006, 154 (12), pp.1722-1741. ⟨10.1016/j.dam.2006.03.005⟩. ⟨hal-01424432⟩



Record views