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 条
  • [1] A (probably) optimal algorithm for BISECTION on bounded-treewidth graphs
    Hanaka, Tesshu
    Kobayashi, Yasuaki
    Sone, Taiga
    THEORETICAL COMPUTER SCIENCE, 2021, 873 : 38 - 46
  • [2] Bisection of bounded treewidth graphs by convolutions
    Eiben, Eduard
    Lokshtanov, Daniel
    Mouawad, Amer E.
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021, 119 : 125 - 132
  • [3] Bisection of bounded treewidth graphs by convolutions
    Eiben, Eduard
    Lokshtanov, Daniel
    Mouawad, Amer E.
    Journal of Computer and System Sciences, 2021, 119 : 125 - 132
  • [4] Bisection of Bounded Treewidth Graphs by Convolutions
    Eiben, Eduard
    Lokshtanov, Daniel
    Mouawad, Amer E.
    27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019), 2019, 144
  • [5] Computing Square Colorings on Bounded-Treewidth and Planar Graphs
    Agrawal, Akanksha
    Marx, Daniel
    Neuen, Daniel
    Slusallek, Jasper
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 2087 - 2110
  • [6] The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
    Cardinal, Jean
    Demaine, Erik D.
    Fiorini, Samuel
    Joret, Gwenael
    Newman, Ilan
    Weimann, Oren
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 25 (01) : 19 - 46
  • [7] Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs
    Jacob, Hugo
    Pilipczuk, Marcin
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2022), 2022, 13453 : 287 - 299
  • [8] The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
    Jean Cardinal
    Erik D. Demaine
    Samuel Fiorini
    Gwenaël Joret
    Ilan Newman
    Oren Weimann
    Journal of Combinatorial Optimization, 2013, 25 : 19 - 46
  • [9] The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs
    Cardinal, Jean
    Demaine, Erik D.
    Fiorini, Samuel
    Joret, Gwenael
    Newman, Ilan
    Weimann, Oren
    INTERNET AND NETWORK ECONOMICS, PROCEEDINGS, 2009, 5929 : 125 - +
  • [10] Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs
    Okrasa, Karolina
    Rzazewski, Pawel
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1578 - 1590
12345