Treewidth: Computational experiments

Electronic Notes in Discrete Mathematics

Volumn 8, Issue , 2001, Pages 1-4

  Koster, Arie M C A ^a   Bodlaender, Hans L ^b   Van Hoesel, Stan P M ^c  

^a ZUSE INSTITUTE BERLIN   (Germany)

^b UTRECHT UNIVERSITY   (Netherlands)

^c MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 52549087323     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. H. L. Bodlaender. A tourist guide through treewidth. Acta Cybernetica, 11(1-2):1-21, 1993.
2. W. Cook and P. D. Seymour. An algorithm for the ring-router problem. Technical report, Bellcore, 1994.
3. A. M. C. A. Koster. Frequency Assignment - Models and Algorithms. PhD thesis, Maastricht University, 1999. Available at http://www.zib.de/koster/.
4. S. J. Lauritzen and D. J. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. The Journal of the Royal Statistical Society. Series B (Methodological), 50:157-224, 1988.
5. N. Robertson and P. D. Seymour. Graph minors. II. algorithmic aspects of tree-width. Journal of Algorithms, 7:309-322, 1986.
6. D. J. Rose, R. E. Tarjan, and G. S. Leuker. Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing, 5:266-283, 1976.
7. R. E. Tarjan and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing, 13(3):566-579, 1984.
8. B. Verweij. Selected Applications of Integer Programming: A Computational Study. PhD thesis, Universiteit Utrecht, Utrecht, The Netherlands, 2000.