Tree Decompositions of Graphs: Saving Memory in Dynamic Programming

Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann. Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. Electronic Notes in Discrete Mathematics, 17:57-62, 2004. [doi]

@article{BetzlerNU04,
  title = {Tree Decompositions of Graphs: Saving Memory in Dynamic Programming},
  author = {Nadja Betzler and Rolf Niedermeier and Johannes Uhlmann},
  year = {2004},
  doi = {10.1016/j.endm.2004.03.023},
  url = {http://dx.doi.org/10.1016/j.endm.2004.03.023},
  tags = {graph-rewriting, programming, rewriting},
  researchr = {https://researchr.org/publication/BetzlerNU04},
  cites = {0},
  citedby = {0},
  journal = {Electronic Notes in Discrete Mathematics},
  volume = {17},
  pages = {57-62},
}