Heuristic and metaheuristic methods for computing graph treewidth

RAIRO - Operations Research

Volumn 38, Issue 1, 2004, Pages 13-26

  Clautiaux, François ^a   Moukrim, Aziz ^a   Nè, Stéphane ^b   Carlier, Jacques ^a  

^a CNRS   (France)

^b INSSET   (France)

Author keywords

Computational experiments; Elimination orderings; Heuristic; Metaheuristic; Treewidth; Triangulated graphs

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; HEURISTIC METHODS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SEPARATORS; TREES (MATHEMATICS);

COMPUTATIONAL EXPERIMENTS; ELIMINATION ORDERINGS; METAHEURISTICS; TREEWIDTH; TRIANGULATED GRAPHS;

OPERATIONS RESEARCH;

EID: 2342466771     PISSN: 03990559     EISSN: 28047303     Source Type: Journal    
DOI: 10.1051/ro:2004011     Document Type: Article

References (21)

1. E. Aarts and J.K. Lenstra, Local Search in Combinatorial Optimization. Series in Discrete Mathematics and Optimization. John Wiley and Sons (1997).
2. R. Ahuja, O. Ergun, J. Orlin and A. Punnen, A survey on very large-scale neighborhood search techniques. Discrete Appl. Math. 123 (2002) 75-102.
3. S. Arnborg, D.G. Cornell and A. Proskurowski, Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth. 8 (1987) 277-284.
4. S. Arnborg and A. Proskurowki, Characterisation and recognition of partial 3-trees. SIAM J. Alg. Disc. Meth. 7 (1986) 305-314.
5. H. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 28 (1996) 1305-1317.
6. J. Carlier and C. Lucet, A decomposition algorithm for network reliability evaluation. Discrete Appl. Math. 65 (1993) 141-156.
7. F. Clautiaux, J. Carlier, A. Moukrim and S. Nègre, New lower and upper bounds for graph treewidth. WEA 2003, Lect. Notes Comput. Sci. 2647 (2003) 70-80.
8. F. Gavril, Algorithms for minimum coloring, maximum clique, minimum coloring cliques and maximum independent set of a chordal graph. SIAM J. Comput. 1 (1972) 180-187.
9. F. Glover and M. Laguna, Tabu search. Kluwer Academic Publishers (1998).
10. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980).
11. F. Jensen, S. Lauritzen and K. Olesen, Bayesian updating in causal probabilistic networks by local computations. Comput. Statist. Quaterly 4 (1990) 269-282.
12. D.S. Johnson and M.A. Trick, The Second DIMACS Implementation Challenge: NP-Hard Problems: Maximum Clique, Graph Coloring, and Satisfiability. Series in Discrete Math. Theor. Comput. Sci. Amer. Math. Soc. (1993).
13. A. Koster, Frequency Assignment, Models and Algorithms. Ph.D. Thesis, Universiteit Maastricht (1999).
14. A. Koster, H. Bodlaender and S. van Hoesel, Treewidth: Computational experiments. Fund. Inform. 49 (2001) 301-312.
15. C. Lucet, J.F. Manouvrier and J. Carlier, Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs. Algorithmica 27 (2000) 316-336.
16. C. Lucet, F. Mendes and A. Moukrim, Méthode de décomposition appliquée à la coloration de graphes, in ROADEF (2002).
17. N. Robertson and P. Seymour, Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms T (1986) 309-322.
18. D. Rose, Triangulated graphs and the elimination process. J. Math. Anal. Appl. 32 (1970) 597-609.
19. D. Rose, A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, in Graph Theory and Computing, edited by R.C. Reed. Academic Press (1972) 183-217.
20. D. Rose, R. Tarjan and G. Lueker, Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. B (1976) 146-160.
21. R. Tarjan and M. Yannakakis, Simple linear-time algorithm to test chordality of graphs, test acyclicity of hypergraphs, and selectivity reduce acyclic hypergraphs. SIAM J. Comput. 13 (1984) 566-579.