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 条
12345