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 条
  • [31] Recognizing Map Graphs of Bounded Treewidth
    Patrizio Angelini
    Michael A. Bekos
    Giordano Da Lozzo
    Martin Gronemann
    Fabrizio Montecchiani
    Alessandra Tappini
    Algorithmica, 2024, 86 : 613 - 637
  • [32] Bisection of bounded treewidth graphs by convolutions
    Eiben, Eduard
    Lokshtanov, Daniel
    Mouawad, Amer E.
    Journal of Computer and System Sciences, 2021, 119 : 125 - 132
  • [33] Equitable colorings of bounded treewidth graphs
    Bodlaender, HL
    Fomin, FV
    THEORETICAL COMPUTER SCIENCE, 2005, 349 (01) : 22 - 30
  • [34] Recognizing Map Graphs of Bounded Treewidth
    Angelini, Patrizio
    Bekos, Michael A.
    Da Lozzo, Giordano
    Gronemann, Martin
    Montecchiani, Fabrizio
    Tappini, Alessandra
    ALGORITHMICA, 2024, 86 (02) : 613 - 637
  • [35] Combinatorial optimization on graphs of bounded treewidth
    Bodlaender, Hans L.
    Koster, Arie M.C.A.
    Computer Journal, 2008, 51 (03): : 255 - 269
  • [36] Bisection of Bounded Treewidth Graphs by Convolutions
    Eiben, Eduard
    Lokshtanov, Daniel
    Mouawad, Amer E.
    27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019), 2019, 144
  • [37] On the treewidth of dynamic graphs
    Mans, Bernard
    Mathieson, Luke
    THEORETICAL COMPUTER SCIENCE, 2014, 554 : 217 - 228
  • [38] Clustered coloring of graphs with bounded layered treewidth and bounded degree
    Liu, Chun-Hung
    Wood, David R.
    EUROPEAN JOURNAL OF COMBINATORICS, 2024, 122
  • [39] An algorithm for the Tutte polynomials of graphs of bounded treewidth
    Andrzejak, A
    DISCRETE MATHEMATICS, 1998, 190 (1-3) : 39 - 54
  • [40] Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
    Chaplick, Steven
    Fiala, Jiri
    van't Hof, Pim
    Paulusma, Daniel
    Tesar, Marek
    THEORETICAL COMPUTER SCIENCE, 2015, 590 : 86 - 95
12345