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 条
  • [41] Product Dimension of Forests and Bounded Treewidth Graphs
    Chandran, L. Sunil
    Mathew, Rogers
    Rajendraprasad, Deepak
    Sharma, Roohani
    ELECTRONIC JOURNAL OF COMBINATORICS, 2013, 20 (03):
  • [42] Hitting forbidden subgraphs in graphs of bounded treewidth
    Cygan, Marek
    Marx, Daniel
    Pilipczuk, Marcin
    Pilipczuk, Michal
    INFORMATION AND COMPUTATION, 2017, 256 : 62 - 82
  • [43] Integrating and Sampling Cuts in Bounded Treewidth Graphs
    Bezakova, Ivona
    Chambers, Erin W.
    Fox, Kyle
    ADVANCES IN THE MATHEMATICAL SCIENCES, 2016, 6 : 401 - 415
  • [44] Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth
    Cygan, Marek
    Marx, Daniel
    Pilipczuk, Marcin
    Pilipczuk, Michal
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE, PT II, 2014, 8635 : 189 - 200
  • [45] Definability equals recognizability for graphs of bounded treewidth
    Bojanczyk, Mikolaj
    Pilipczuk, Michal
    PROCEEDINGS OF THE 31ST ANNUAL ACM-IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2016), 2016, : 407 - 416
  • [46] Approximating Sparsest Cut in Graphs of Bounded Treewidth
    Chlamtac, Eden
    Krauthgamer, Robert
    Raghavendra, Prasad
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2010, 6302 : 124 - +
  • [47] Maximum Induced Forests in Graphs of Bounded Treewidth
    Chappell, Glenn G.
    Pelsmajer, Michael J.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2013, 20 (04):
  • [48] Embedding graphs with bounded treewidth into their optimal hypercubes
    Heun, V
    Mayr, EW
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2002, 43 (01): : 17 - 50
  • [49] Distance constrained labelings of graphs of bounded treewidth
    Fiala, J
    Golovach, PA
    Kratochvíl, J
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 360 - 372
  • [50] Orthogonal planarity testing of bounded treewidth graphs
    Di Giacomo, Emilio
    Liotta, Giuseppe
    Montecchiani, Fabrizio
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2022, 125 : 129 - 148
12345