Space saving by dynamic algebraization

Martin Fürer, Huiwen Yu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations


Dynamic programming is widely used for exact computations based on tree decompositions of graphs. However, the space complexity is usually exponential in the treewidth. We study the problem of designing efficient dynamic programming algorithm based on tree decompositions in polynomial space. We show how to construct a tree decomposition and extend the algebraic techniques of Lokshtanov and Nederlof [18] such that the dynamic programming algorithm runs in time O *(2 h ), where h is the maximum number of vertices in the union of bags on the root to leaf paths on a given tree decomposition, which is a parameter closely related to the tree-depth of a graph [21]. We apply our algorithm to the problem of counting perfect matchings on grids and show that it outperforms other polynomial-space solutions. We also apply the algorithm to other set covering and partitioning problems.

Original languageEnglish (US)
Title of host publicationComputer Science Theory and Applications - 9th International Computer Science Symposium in Russia, CSR 2014, Proceedings
PublisherSpringer Verlag
Number of pages14
ISBN (Print)9783319066851
StatePublished - 2014
Event9th International Computer Science Symposium in Russia, CSR 2014 - Moscow, Russian Federation
Duration: Jun 7 2014Jun 11 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8476 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other9th International Computer Science Symposium in Russia, CSR 2014
Country/TerritoryRussian Federation

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Space saving by dynamic algebraization'. Together they form a unique fingerprint.

Cite this