Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming

• Published in: Algorithms Vol. 11; no. 7; p. 98
• Main Authors: Chen, Li-Hsuan, Reidl, Felix, Rossmanith, Peter, Sánchez Villaamil, Fernando
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.07.2018
• Subjects: 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

Treedepth is a well-established width measure which has recently seen a resurgence of interest. Since graphs of bounded treedepth are more restricted than graphs of bounded tree- or pathwidth, we are interested in the algorithmic utility of this additional structure. On the negative side, we show wi...