The problem of dynamically recognizing a class of graphs has received much attention recently. Given an input graph and a sequence of operations (vertex and edge additions and deletions) to be performed on that graph, the algorithm must determine after each operation if the resulting graph is still a member of the class in question. This paper presents the first dynamic recognition algorithm for distance-hereditary graphs. The algorithm handles edge additions and deletions, and is optimal in that each operation can be performed in constant time. In doing so, the paper completely characterizes when an edge can be added to and removed from a distance-hereditary graph with the result remaining distance-hereditary, and develops a new representation for these graphs in terms of cographs. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Tedder, M., & Corneil, D. (2007). An optimal, edges-only fully dynamic algorithm for distance-hereditary graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4393 LNCS, pp. 344–355). Springer Verlag. https://doi.org/10.1007/978-3-540-70918-3_30
Mendeley helps you to discover research relevant for your work.