An optimal algorithm for BISECTION for bounded-treewidth graphs

被引：0
|
作者：
Hanaka, Tesshu [1 ]
Kobayashi, Yasuaki [2 ]
Sone, Taiga [2 ]
机构：
[1] Chuo University, Kasuga, Bunkyo-ku, Tokyo,112-8551, Japan
[2] Kyoto University, Yoshida-honmachi, Sakyo-ku, Kyoto,606-8501, Japan
来源：
arXiv | 2020年
关键词：
921.4 Combinatorial Mathematics; Includes Graph Theory; Set Theory - 921.5 Optimization Techniques;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Optimization
引用
收藏
相关论文
共 50 条
  • [41] Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms
    Édouard Bonnet
    Nick Brettell
    O-joung Kwon
    Dániel Marx
    Algorithmica, 2019, 81 : 3890 - 3935
  • [42] A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs
    Dinneen, Michael J.
    Khosravani, Masoud
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS, 2010, 6058 : 237 - 246
  • [43] Clustered coloring of graphs with bounded layered treewidth and bounded degree
    Liu, Chun-Hung
    Wood, David R.
    EUROPEAN JOURNAL OF COMBINATORICS, 2024, 122
  • [44] 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
  • [45] Product Dimension of Forests and Bounded Treewidth Graphs
    Chandran, L. Sunil
    Mathew, Rogers
    Rajendraprasad, Deepak
    Sharma, Roohani
    ELECTRONIC JOURNAL OF COMBINATORICS, 2013, 20 (03):
  • [46] Hitting forbidden subgraphs in graphs of bounded treewidth
    Cygan, Marek
    Marx, Daniel
    Pilipczuk, Marcin
    Pilipczuk, Michal
    INFORMATION AND COMPUTATION, 2017, 256 : 62 - 82
  • [47] Integrating and Sampling Cuts in Bounded Treewidth Graphs
    Bezakova, Ivona
    Chambers, Erin W.
    Fox, Kyle
    ADVANCES IN THE MATHEMATICAL SCIENCES, 2016, 6 : 401 - 415
  • [48] 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
  • [49] 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
  • [50] 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 - +
12345