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 条
  • [21] Waypoint routing on bounded treewidth graphs
    Schierreich, Simon
    Suchy, Ondrej
    INFORMATION PROCESSING LETTERS, 2022, 173
  • [22] Combinatorial optimization on graphs of bounded treewidth
    Bodlaender, Hans L.
    Koster, Arie M. C. A.
    COMPUTER JOURNAL, 2008, 51 (03): : 255 - 269
  • [23] Replica Placement on Bounded Treewidth Graphs
    Aggarwal, Anshul
    Chakaravarthy, Venkatesan T.
    Gupta, Neelima
    Sabharwal, Yogish
    Sharma, Sachin
    Thakral, Sonika
    ALGORITHMS AND DATA STRUCTURES: 15TH INTERNATIONAL SYMPOSIUM, WADS 2017, 2017, 10389 : 13 - 24
  • [24] Coresets for Clustering in Graphs of Bounded Treewidth
    Baker, Daniel
    Braverman, Vladimir
    Huang, Lingxiao
    Jiang, Shaofeng H-C
    Krauthgamer, Robert
    Wu, Xuan
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 119, 2020, 119
  • [25] Channel assignment on graphs of bounded treewidth
    McDiarmid, C
    Reed, B
    DISCRETE MATHEMATICS, 2003, 273 (1-3) : 183 - 192
  • [26] Defensive alliances in graphs of bounded treewidth
    Bliem, Bernhard
    Woltran, Stefan
    DISCRETE APPLIED MATHEMATICS, 2018, 251 : 334 - 339
  • [27] Bisection of bounded treewidth graphs by convolutions
    Eiben, Eduard
    Lokshtanov, Daniel
    Mouawad, Amer E.
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021, 119 : 125 - 132
  • [28] On the number of labeled graphs of bounded treewidth
    Baste, Julien
    Noy, Marc
    Sau, Ignasi
    EUROPEAN JOURNAL OF COMBINATORICS, 2018, 71 : 12 - 21
  • [29] Equitable colorings of bounded treewidth graphs
    Bodlaender, HL
    Fomin, FV
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004, PROCEEDINGS, 2004, 3153 : 180 - 190
  • [30] On the Number of Labeled Graphs of Bounded Treewidth
    Baste, Julien
    Noy, Marc
    Sau, Ignasi
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2017), 2017, 10520 : 88 - 99
12345