Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs
From MaRDI portal
Publication:3196398
DOI10.1007/978-3-319-21398-9_28zbMath1465.68203OpenAlexW2281382292MaRDI QIDQ3196398
Sankardeep Chakraborty, Niranka Banerjee, Venkatesh Raman, Saket Saurabh, Sasanka Roy
Publication date: 29 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21398-9_28
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
Space-efficient vertex separators for treewidth ⋮ Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS ⋮ Frameworks for designing in-place graph algorithms ⋮ A Framework for In-place Graph Algorithms ⋮ Approximation in (Poly-) logarithmic space ⋮ Improved Space Efficient Algorithms for BFS, DFS and Applications ⋮ Unnamed Item ⋮ Space efficient linear time algorithms for BFS, DFS and applications
This page was built for publication: Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs
