Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming - Chen, Li-Hsuan; Reidl, Felix; Rossmanith, Peter; Sánchez Villaamil, Fernando (Algorithms, 2018)
Keywords: Algorithms; branching algorithm; Coloring; Computer science; Decomposition; Dynamic programming; Graphs; Run time (computers); space lower bound; Theory; treedepth; treewidth; Denmark; Aachen Germany; United States--US; Germany