Tree decompositions of graphs: Saving memory in dynamic programming-Reference-Cited by-同舟云学术

Tree decompositions of graphs: Saving memory in dynamic programming

Published:2006-09 Issue:3 Volume:3 Page:220-229
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Betzler Nadja,Niedermeier Rolf,Uhlmann Johannes

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference30 articles.

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. Fixed parameter algorithms for Dominating Set and related problems on planar graphs;Alber;Algorithmica,2002

3. Experimental evaluation of a tree decomposition based algorithm for Vertex Cover on planar graphs;Alber;Discrete Applied Mathematics,2005

4. Improved tree decomposition based algorithms for domination-like problems;Alber,2002

5. Memory requirements for table computations in partial k-tree algorithms;Aspvall;Algorithmica,2000

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Path Cover Problems with Length Cost;Algorithmica;2023-03-06

2. Complexity of the Maximum k-Path Vertex Cover Problem;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2020-10-01

3. Complexity of the Maximum k-Path Vertex Cover Problem;WALCOM: Algorithms and Computation;2018

4. Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes;IEICE Transactions on Information and Systems;2018

5. On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs;ACM Transactions on Computation Theory;2017-12-31