Abstract

In this paper, we consider algorithms for maintaining tree-decompositions with constant bounded treewith under edge and vertex insertions and deletions for graphs with treewith at most 2 (also called: partial 2-trees, or series-parallel graphs), and for almost trees with parameter k. Each operation can be performed in O(log n)
... read more