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 条

[21] A New Upper Bound for Cancellative Pairs
Janzer, Barnabas
ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (02):
[22] A NEW UPPER BOUND FOR THE LENGTH OF SNAKES
DEIMER, K
COMBINATORICA, 1985, 5 (02) : 109 - 120
[23] Treewidth computations I. Upper bounds
Bodlaender, Hans L.
Koster, Arie M. C. A.
INFORMATION AND COMPUTATION, 2010, 208 (03) : 259 - 275
[24] A spectral lower bound for the treewidth of a graph and its consequences
Chandran, LS
Subramanian, CR
INFORMATION PROCESSING LETTERS, 2003, 87 (04) : 195 - 200
[25] New upper bound on vertex Folkman numbers
Dudek, Andrzej
Rodl, Vojtech
LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 473 - 478
[26] A new upper bound for the multiple knapsack problem
Detti, Paolo
COMPUTERS & OPERATIONS RESEARCH, 2021, 129
[27] A new upper bound on the Cheeger number of a graph
Dragomir, S
Barletta, E
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2001, 82 (02) : 167 - 174
[28] A new upper bound for finite additive bases
Gunturk, C. Sinan
Nathanson, Melvyn B.
ACTA ARITHMETICA, 2006, 124 (03) : 235 - 255
[29] A new tight upper bound on the transposition distance
Labarre, A
ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2005, 3692 : 216 - 227
[30] A new upper bound for the bipartite Ramsey problem
Conlon, David
JOURNAL OF GRAPH THEORY, 2008, 58 (04) : 351 - 356

← 1 2 3 4 5 →