Tree decompositions of graphs: saving memory in dynamic programming
From MaRDI portal
Publication:2465936
DOI10.1016/j.disopt.2006.05.008zbMath1128.68072MaRDI QIDQ2465936
Rolf Niedermeier, Johannes Uhlmann, Nadja Betzler
Publication date: 11 January 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2006.05.008
dynamic programming; graph algorithms; set covering; memory usage; (nice) tree decompositions of graphs
68R10: Graph theory (including graph drawing) in computer science
90C39: Dynamic programming
05C85: Graph algorithms (graph-theoretic aspects)
Uses Software