Safe separators for treewidth

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithms and Combinatorics

Volumn , Issue , 2004, Pages 70-78

  Bodlaender, Hans L ^a   Koster, Arie M C A ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MAPPING; PROBABILISTIC LOGICS; PROBLEM SOLVING; SEPARATORS;

FREQUENCY ASSIGNMENT; PROBABILISTIC NETWORKS; SAFE SEPARATORS; TREEWIDTH;

TREES (MATHEMATICS);

EID: 8344278004     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. K. I. Aardal, C. A. J. Hurkens, J. K. Lenstra, and S. R. Tiourine. Algorithms for radio link frequency assignment: The CALMA project. Operations Research, 50(6):968 - 980, 2003.
2. S. Arnborg, D. G. Cornell, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth., 8:277-284, 1987.
3. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12:308-340, 1991.
4. A. Berry, J. R. S. Blair, and P. Heggernes. Maximum cardinality search for computing minimal triangulations. In P. Widmayer, editor, Proceedings 28th Int. Workshop on Graph Theoretic Concepts in Computer Science, WG'02, pages 1-12. Springer Verlag, Lecture Notes in Computer Science, vol. 2573, 2002.
5. A. Bery and J.-P. Bordat. Decomposition by clique minimal separators. Research report, LIM, Marseiller, 1997.
6. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25:1305-1317, 1996.
7. H. L. Bodlaender. Treewidth: Algorithmic techniques and results. In I. Privara and P. Ruzicka, editors, Proceedings 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS'97, Lecture Notes in Computer Science, volume 1295, pages 19-36, Berlin, 1997. Springer-Verlag.
8. H. L. Bodlaender, A. M. C. A. Koster, F. van den Eijkhof, and L. C. van der Gaag. Pre-processing for triangulation of probabilistic networks. In J. Breese and D. Koller, editors, Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, pages 32-39, San Francisco, 2001. Morgan Kaufmann.
9. R. B. Borie, R. G. Parker, and C. A. Tovey. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica, 7:555-581, 1992.
10. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, Mass., USA, 1989.
11. B. Courcelle and M. Mosbah. Monadic second-order evaluations on tree-decomposable graphs. Theor. Comp. Sc., 109:49-82, 1993.
12. S. Even. Graph Algorithms. Pitman, London, 1979.
13. J. E. Hopcroft and R. E. Tarjan. Dividing a graph into triconnected components. SIAM J. Comput., 2:135-158, 1973.
14. A. Kanevsky and V Ramachandran. Improved algorithms for graph four-connectivity. J. Comp. Syst. Sc., 42:288-306, 1991.
15. A. M. C. A. Koster, S. P. M. van Hoesel, and A. W. J. Kolen. Solving partial constraint satisfaction problems with tree decomposition. Networks, 40:170-180, 2002.
16. 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.
17. H.-G. Leimer. Optimal decomposition by clique separators. Disc. Math., 113:99-123, 1993.
18. K. Menger. Zur allgemeinen kurventheorie. Fund. Math., 10:96-115, 1927.
19. K. G. Olesen and A. L. Madsen. Maximal prime subgraph decomposition of Bayesian networks. Technical report, Department of Computer Science, Aalborg University, Aalborg, Denmark, 1999.
20. H. Röhrig. Tree decomposition: A feasibility study. Master's thesis, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 1998.
21. R. E. Tarjan. Depth first search and linear graph algorithms. SIAM J. Comput., 1:146-160, 1972.
22. R. E. Tarjan. Decomposition by clique separators. Disc. Math., 55:221-232, 1985.