New Upper Bound Heuristics for Treewidth

@inproceedings{Bachoore2005NewUB,
  title={New Upper Bound Heuristics for Treewidth},
  author={Emgad H. Bachoore and Hans L. Bodlaender},
  booktitle={WEA},
  year={2005}
}
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. 

Similar Papers

Loading similar papers…