Volume 38, Number 1, January-March 2004
|Page(s)||13 - 26|
|Published online||15 April 2004|
Heuristic and metaheuristic methods for computing graph treewidth
Laboratoire HeuDiaSyC, UMR CNRS 6599, UTC, BP 20529, 60205 Compiègne, France;
firstname.lastname@example.org., email@example.com., firstname.lastname@example.org.
2 Laboratoire de Recherche en Informatique d'Amiens, INSSET, 48 rue Raspail, 02100 St Quentin, France; email@example.com.
Accepted: 19 December 2003
The notion of treewidth is of considerable interest in relation to NP-hard problems. Indeed, several studies have shown that the tree-decomposition method can be used to solve many basic optimization problems in polynomial time when treewidth is bounded, even if, for arbitrary graphs, computing the treewidth is NP-hard. Several papers present heuristics with computational experiments. For many graphs the discrepancy between the heuristic results and the best lower bounds is still very large. The aim of this paper is to propose two new methods for computing the treewidth of graphs: a heuristic and a metaheuristic. The heuristic returns good results in a short computation time, whereas the metaheuristic (a Tabu search method) returns the best results known to have been obtained so far for all the DIMACS vertex coloring / treewidth benchmarks (a well-known collection of graphs used for both vertex coloring and treewidth problems.) Our results actually improve on the previous best results for treewidth problems in 53% of the cases. Moreover, we identify properties of the triangulation process to optimize the computing time of our method.
Key words: Treewidth / elimination orderings / triangulated graphs / heuristic / metaheuristic / computational experiments.
© EDP Sciences, 2004
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.