The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper presents an optimal algorithm for this problem on vertex-dynamic connected distance hereditary graphs: both vertex insertion and deletion have complexity O(d), where d is the degree of the vertex involved in the modification. Our vertex-dynamic algorithm is competitive with the existing linear time recognition algorithms of distance hereditary graphs, and is also simpler. Besides, we get a constant time edge-dynamic recognition algorithm. To achieve this, we revisit the split decomposition by introducing graphlabelled trees. Doing so, we are also able to derive an intersection model for distance hereditary graphs, which answers an open problem. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Gioan, E., & Paul, C. (2007). Dynamic distance hereditary graphs using split decomposition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4835 LNCS, pp. 41–51). Springer Verlag. https://doi.org/10.1007/978-3-540-77120-3_6
Mendeley helps you to discover research relevant for your work.