Skip to main content
Article thumbnail
Location of Repository

Dynamic Algorithms for Graphs with Treewidth 2

By H.L. Bodlaender


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) time. For a large number of graph decision, optimization and counting problems, information can be maintained using O(log n) time per update, such that queries can be resolved in O(log n), or O(1) time. Similar results hold for the classes of almost tress with parameter k, for fixed k

Topics: Wiskunde en Informatica
Year: 1993
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.