Fully Dynamic Recognition Algorithm and Certificate for Directed Cographs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2006

Fully Dynamic Recognition Algorithm and Certificate for Directed Cographs

Résumé

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.

Dates et versions

hal-01424432 , version 1 (02-01-2017)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More