Space Saving by Dynamic Algebraization
From MaRDI portal
Publication:4981176
DOI10.1007/978-3-319-06686-8_29zbMath1408.68073arXiv1406.3414OpenAlexW1579162882MaRDI QIDQ4981176
Publication date: 24 June 2014
Published in: Computer Science - Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.3414
dynamic programmingtree decompositionexponential-time algorithmsspace-efficient algorithmzeta transform
Analysis of algorithms and problem complexity (68Q25) Graph polynomials (05C31) Dynamic programming (90C39) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)