Tree Decompositions of Graphs: Saving Memory in Dynamic Programming

Electronic Notes in Discrete Mathematics

Volumn 17, Issue , 2004, Pages 57-62

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

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750619027     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2004.03.023     Document Type: Article

References (5)

1. 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
2. Aspvall B., Proskurowski A., and Telle J.A. Memory requirements for table computations in partial k-tree algorithms. Algorithmica 27 (2000) 382-394
3. Bodlaender H.L. Treewidth: Algorithmic techniques and results. Proceedings 22nd MFCS. Springer-Verlag LNCS 1295 (1997) 19-36
4. Bodlaender H.L., and Fomin F.V. Tree decompositions with small cost. Proceedings 8th SWAT. Springer-Verlag LNCS 2368 (2002) 378-387
5. J. Guo and R. Niedermeier. Exact algorithms for Tree-like Weighted Set Cover. Manuscript, submitted for publication, February 2004