Dynamic Algorithms for Graphs of Bounded Treewidth

被引：0
|
作者：
T. Hagerup
机构：
[1] Fachbereich Informatik,
[2] Robert-Mayer-Straß e 11—15,undefined
[3] Johann Wolfgang Goethe-Universität Frankfurt,undefined
[4] D-60054 Frankfurt am Main,undefined
[5] Germany. hagerup@informatik.uni-frankfurt.de. The work was done while the author was with the Max-Planck-Institut für Informatik in Saarbrücken,undefined
[6] Germany.,undefined
来源：
Algorithmica | 2000年 / 27卷
关键词：
Key words. Dynamic algorithms, Graph algorithms, Treewidth, Monadic second-order logic, Path queries.;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The formalism of monadic second-order (MS) logic has been very successful in unifying a large number of algorithms for graphs of bounded treewidth. We extend the elegant framework of MS logic from static problems to dynamic problems, in which queries about MS properties of a graph of bounded treewidth are interspersed with updates of vertex and edge labels. This allows us to unify and occasionally strengthen a number of scattered previous results obtained in an ad hoc manner and to enable solutions to a wide range of additional problems to be derived automatically.
引用
收藏
页码：292 / 315
页数：23
相关论文
共 50 条
  • [1] Dynamic algorithms for graphs of bounded treewidth
    Hagerup, T
    ALGORITHMICA, 2000, 27 (3-4) : 292 - 315
  • [2] Dynamic algorithms for graphs of bounded treewidth
    Hagerup, T
    AUTOMATA, LANGUAGES AND PROGRAMMING, 1997, 1256 : 292 - 302
  • [3] Faster algorithms for quantitative verification in bounded treewidth graphs
    Chatterjee, Krishnendu
    Ibsen-Jensen, Rasmus
    Pavlogiannis, Andreas
    FORMAL METHODS IN SYSTEM DESIGN, 2021, 57 (03) : 401 - 428
  • [4] Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal
    Lokshtanov, Daniel
    Marx, Daniel
    Saurabh, Saket
    PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 777 - 789
  • [5] Faster algorithms for quantitative verification in bounded treewidth graphs
    Krishnendu Chatterjee
    Rasmus Ibsen-Jensen
    Andreas Pavlogiannis
    Formal Methods in System Design, 2021, 57 : 401 - 428
  • [6] RESTRICTED SPACE ALGORITHMS FOR ISOMORPHISM ON BOUNDED TREEWIDTH GRAPHS
    Das, Bireswar
    Toran, Jacobo
    Wagner, Fabian
    27TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2010), 2010, 5 : 227 - 238
  • [7] Restricted space algorithms for isomorphism on bounded treewidth graphs
    Das, Bireswar
    Toran, Jacobo
    Wagner, Fabian
    INFORMATION AND COMPUTATION, 2012, 217 : 71 - 83
  • [8] Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal
    Lokshtanov, Daniel
    Marx, Daniel
    Saurabh, Saket
    ACM TRANSACTIONS ON ALGORITHMS, 2018, 14 (02)
  • [9] Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs
    Banerjee, Niranka
    Chakraborty, Sankardeep
    Raman, Venkatesh
    Roy, Sasanka
    Saurabh, Saket
    COMPUTING AND COMBINATORICS, 2015, 9198 : 349 - 360
  • [10] Sparsest Cut on Bounded Treewidth Graphs: Algorithms and Hardness Results
    Gupta, Anupam
    Talwar, Kunal
    Witmer, David
    STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2013, : 281 - 290
12345