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 tree decomposition is updated; otherwise, a certificate is returned within the same complexity. © Springer-Verlag 2004.
Cite
CITATION STYLE
Crespelle, C., & Paul, C. (2004). Fully-dynamic recognition algorithm and certificate for directed cographs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3353, 93–104. https://doi.org/10.1007/978-3-540-30559-0_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
