New upper bound heuristics for treewidth

被引：0
|
作者：
Bachoore, EH [1 ]
Bodlaender, HL [1 ]
机构：
[1] Univ Utrecht, Inst Informat & Comp Sci, NL-3508 TB Utrecht, Netherlands
来源：
EXPERIMENTAL AND EFFICIENT ALGORITHMS, PROCEEDINGS | 2005年 / 3503卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we introduce and evaluate some heuristics to find an upper bound on the treewidth of a given graph. Each of the heuristics selects the vertices of the graph one by one, building an elimination list. The heuristics differ in the criteria used for selecting vertices. These criteria depend on the fill-in of a vertex and the related new notion of the fill-in-excluding-one-neighbor. In several cases, the new heuristics improve the bounds obtained by existing heuristics.
引用
收藏
页码：216 / 227
页数：12
相关论文
共 50 条
  • [1] Turbocharging Treewidth Heuristics
    Gaspers, Serge
    Gudmundsson, Joachim
    Jones, Mitchell
    Mestre, Julian
    Rummele, Stefan
    ALGORITHMICA, 2019, 81 (02) : 439 - 475
  • [2] Turbocharging Treewidth Heuristics
    Serge Gaspers
    Joachim Gudmundsson
    Mitchell Jones
    Julián Mestre
    Stefan Rümmele
    Algorithmica, 2019, 81 : 439 - 475
  • [3] A branch and bound algorithm for exact, upper, and lower bounds on treewidth
    Bachoore, Emgad H.
    Bodlaender, Hans L.
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2006, 4041 : 255 - 266
  • [4] New lower and upper bounds for graph treewidth
    Clautiaux, F
    Carlier, J
    Moukrim, A
    Nègre, S
    EXPERIMENTAL AND EFFICIENCT ALGORITHMS, PROCEEDINGS, 2003, 2647 : 70 - 80
  • [5] On a Spectral Lower Bound of Treewidth
    Gima, Tatsuya
    Hanaka, Tesshu
    Noro, Kohei
    Ono, Hirotaka
    Otachi, Yota
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2024, E107D (03) : 328 - 330
  • [6] Relaxation heuristics for the set multicover problem with generalized upper bound constraints
    Umetani, Shunji
    Arakawa, Masanao
    Yagiura, Mutsunori
    COMPUTERS & OPERATIONS RESEARCH, 2018, 93 : 90 - 100
  • [7] Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks
    Hartung, Sepp
    Hoffmann, Clemens
    Nichterlein, Andre
    EXPERIMENTAL ALGORITHMS, SEA 2014, 2014, 8504 : 376 - 387
  • [8] An improved spectral lower bound of treewidth
    Gima, Tatsuya
    Hanaka, Tesshu
    Noro, Kohei
    Ono, Hirotaka
    Otachi, Yota
    INFORMATION PROCESSING LETTERS, 2025, 188
  • [9] A new entropy upper bound
    Tapus, N.
    Popescu, P. G.
    APPLIED MATHEMATICS LETTERS, 2012, 25 (11) : 1887 - 1890
  • [10] A NEW UPPER BOUND FOR SHELLSORT
    SEDGEWICK, R
    JOURNAL OF ALGORITHMS, 1986, 7 (02) : 159 - 173
12345