Login / Signup

Tree decompositions of graphs: Saving memory in dynamic programming.

Nadja BetzlerRolf NiedermeierJohannes Uhlmann
Published in: Discret. Optim. (2006)
Keyphrases
  • tree decompositions
  • dynamic programming
  • constraint satisfaction problems
  • graph theory
  • tree decomposition
  • stereo matching
  • databases
  • complexity bounds
  • state space
  • np complete
  • constraint satisfaction