Tree decompositions of graphs: Saving memory in dynamic programming

Discrete Optimization

Volumn 3, Issue 3, 2006, Pages 220-229

  Betzler, Nadja ^a   Niedermeier, Rolf ^b   Uhlmann, Johannes ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

(nice) Tree decompositions of graphs; Dynamic programming; Graph algorithms; Memory usage; Set covering

Indexed keywords

COMPUTATION THEORY; DYNAMIC PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

(NICE) TREE DECOMPOSITIONS OF GRAPHS; GRAPH ALGORITHMS; MEMORY USAGE; SET COVERING;

GRAPH THEORY;

EID: 33746347367     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2006.05.008     Document Type: Article

References (30)

1. J. Alber, N. Betzler, R. Niedermeier, Experiments on data reduction for optimal domination in networks, in: Proceedings 1st INOC, 2003, pp. 1-6 (Long version to appear in Annals of Operations Research)
2. Alber J., Bodlaender H.L., Fernau H., Kloks T., and Niedermeier R. Fixed parameter algorithms for Dominating Set and related problems on planar graphs. Algorithmica 33 4 (2002) 461-493
3. Alber J., Dorn F., and Niedermeier R. Experimental evaluation of a tree decomposition based algorithm for Vertex Cover on planar graphs. Discrete Applied Mathematics 145 2 (2005) 219-231
4. Alber J., and Niedermeier R. Improved tree decomposition based algorithms for domination-like problems. Proceedings 5th LATIN 2002. LNCS vol. 2286 (2002), Springer-Verlag 613-627
5. Aspvall B., Proskurowski A., and Telle J.A. Memory requirements for table computations in partial k-tree algorithms. Algorithmica 27 3 (2000) 382-394
6. Bodlaender H.L. Treewidth: Algorithmic techniques and results. Proceedings 22nd MFCS. LNCS vol. 1295 (1997), Springer-Verlag 19-36
7. Bodlaender H.L. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209 (1998) 1-45
8. Bodlaender H.L. Discovering treewidth. Proceedings 31st SOFSEM. LNCS vol. 3381 (2005), Springer-Verlag 1-16
9. Bodlaender H.L., and Fomin F.V. Tree decompositions with small cost. Discrete Applied Mathematics 145 2 (2005) 143-154
10. H.L. Bodlaender, A.M.C.A. Koster, F. van den Eijkhof, Pre-processing rules for triangulation of probabilistic networks, Technical Report, Institute of Information and Computing Science, Utrecht University, 2003
11. E.D. Demaine, M. Taghi Hajiaghayi, Bidimensionality: new connections between FPT algorithms and PTASs, in: Proceedings 16th ACM-SIAM Symposium on Discrete Algorithms, SODA, 2005, pp. 590-601
12. F.V. Fomin, D.M. Thilikos, Dominating sets in planar graphs: branch-width and exponential speed-up, in: Proceedings 14th ACM-SIAM Symposium on Discrete Algorithms, SODA, 2003, pp. 168-177
13. J. Guo, R. Niedermeier, Exact algorithms and applications for Tree-like Weighted Set Cover, Journal of Discrete Algorithms (2005) (in press)
14. Guo J., Niedermeier R., and Raible D. Improved algorithms and complexity results for power domination in graphs. Proceedings 15th FCT. LNCS vol. 3623 (2005), Springer-Verlag 172-184
15. Kloks T. Treewidth. Computations and Approximations. LNCS vol. 842 (1994), Springer-Verlag
16. Koster A.M.C.A., Bodlaender H.L., and Hoesel S.P.M. Treewidth: Computational Experiments. Electronic Notes in Discrete Mathematics vol. 8 (2001), Elsevier Science Publishers
17. Koster A.M.C.A., van Hoesel S.P.M., and Kolen A.W.J. Solving Frequency Assignment Problems via Tree-decomposition. Electronic Notes in Discrete Mathematics vol. 3 (1999), Elsevier Science Publishers
18. Koster A.M.C.A., van Hoesel S.P.M., and Kolen A.W.J. Solving partial constraint satisfaction problems with tree decompositions. Networks 40 3 (2002) 170-180
19. Medina A., Lakhina A., Matta I., and Byers J. BRITE: An approach to universal topology generation. Proceedings MASCOTS 2001 (2001), IEEE Computer Society August
20. Manouvrier J.-F., and Lucet C. Resolving the network reliability problem with a tree decomposition of the graph. Proceedings 1st OPODIS (1997), Hermes 193-204
21. Mecke S., and Wagner D. Solving geometric covering problems by data reduction. Proceedings 12th ESA. LNCS vol. 3221 (2004), Springer-Verlag 760-771
22. Mehlhorn K., and Näher S. LEDA: A Platform of Combinatorial and Geometric Computing (1999), Cambridge University Press, Cambridge, England
23. R.D.M. Page, J.A. Cotton, Vertebrate phylogenomics: reconciled trees and gene duplications, in: Proceedings Pacific Symposium on Biocomputing 2002, 2002, pp. 536-547
24. Y. Song, C. Liu, R. Malmberg, F. Pan, L. Cai, Tree decomposition based fast search of RNA structures including pseudoknots in genomes, in: Proceedings IEEE Computational Systems Bioinformatics Conference, 2005
25. Tarjan R.E., and Yannakakis M. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing 13 3 (1984) 566-579
26. Telle J.A., and Proskurowski A. Practical algorithms on partial k-trees with an application to domination-like problems. Proceedings 3rd WADS'93. LNCS vol. 709 (1993), Springer-Verlag 610-621
27. Veinott A.F., and Wagner H.M. Optimal capacity scheduling. Operations Research 10 (1962) 518-532
28. K. Weihe, Covering trains by stations or the power of data reduction, in: Proceedings 1'st ALEX '98, 1998, pp. 1-8
29. Wolle T. A framework for network reliability problems on graphs of bounded treewidth. Proceedings 13th ISAAC 2002. LNCS vol. 2518 (2002), Springer-Verlag 137-149
30. J. Xu, F. Jiao, B. Berger, A tree-decomposition approach to protein structure prediction, in: Proceedings IEEE Computational Systems Bioinformatics Conference, 2005