Treewidth Lower Bounds with Brambles

被引：0
|
作者：
Hans L. Bodlaender
Alexander Grigoriev
Arie M. C. A. Koster
机构：
[1] Utrecht University,Department of Information and Computing Sciences
[2] University of Maastricht,Department of Quantitative Economics
[3] Zuse Institute Berlin (ZIB),undefined
来源：
Algorithmica | 2008年 / 51卷
关键词：
Treewidth; Lower bound; Bramble; Planar graph; Grid minor; Approximation algorithm;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper we present a new technique for computing lower bounds for graph treewidth. Our technique is based on the fact that the treewidth of a graph G is the maximum order of a bramble of G minus one. We give two algorithms: one for general graphs, and one for planar graphs. The algorithm for planar graphs is shown to give a lower bound for both the treewidth and branchwidth that is at most a constant factor away from the optimum. For both algorithms, we report on extensive computational experiments that show that the algorithms often give excellent lower bounds, in particular when applied to (close to) planar graphs.
引用
收藏
页码：81 / 98
页数：17
相关论文
共 50 条
  • [1] Treewidth lower bounds with brambles
    Bodlaender, HL
    Grigoriev, A
    Koster, AMCA
    [J]. ALGORITHMS - ESA 2005, 2005, 3669 : 391 - +
  • [2] Treewidth lower bounds with brambles
    Bodlaender, Hans L.
    Grigoriev, Alexander
    Koster, Arie M. C. A.
    [J]. ALGORITHMICA, 2008, 51 (01) : 81 - 98
  • [3] Contraction and treewidth lower bounds
    Bodlaender, HL
    Koster, AMCA
    Wolle, T
    [J]. ALGORITHMS ESA 2004, PROCEEDINGS, 2004, 3221 : 628 - 639
  • [4] Lower Bounds for QBFs of Bounded Treewidth
    Fichte, Johannes K.
    Hecher, Markus
    Pfandler, Andreas
    [J]. PROCEEDINGS OF THE 35TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2020), 2020, : 410 - 424
  • [5] Lower bounds for treewidth of product graphs
    Kozawa, Kyohei
    Otachi, Yota
    Yamazaki, Koichi
    [J]. DISCRETE APPLIED MATHEMATICS, 2014, 162 : 251 - 258
  • [6] Degree-based treewidth lower bounds
    Koster, AMCA
    Wolle, T
    Bodlaender, HL
    [J]. EXPERIMENTAL AND EFFICIENT ALGORITHMS, PROCEEDINGS, 2005, 3503 : 101 - 112
  • [7] New lower and upper bounds for graph treewidth
    Clautiaux, F
    Carlier, J
    Moukrim, A
    Nègre, S
    [J]. EXPERIMENTAL AND EFFICIENCT ALGORITHMS, PROCEEDINGS, 2003, 2647 : 70 - 80
  • [8] Treewidth computations II. Lower bounds
    Bodlaender, Hans L.
    Koster, Arie M. C. A.
    [J]. INFORMATION AND COMPUTATION, 2011, 209 (07) : 1103 - 1119
  • [9] Achievable sets, brambles, and sparse treewidth obstructions
    Lucena, Brian
    [J]. DISCRETE APPLIED MATHEMATICS, 2007, 155 (08) : 1055 - 1065
  • [10] A branch and bound algorithm for exact, upper, and lower bounds on treewidth
    Bachoore, Emgad H.
    Bodlaender, Hans L.
    [J]. ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2006, 4041 : 255 - 266
12345