Abstract
Recently, new techniques have been introduced to speed up dynamic programming algorithms on tree decompositions for connectivity problems: the `Cut and Count' method and a method called the rank-based approach, based on representative sets and Gaussian elimination. These methods respectively give randomized and deterministic algorithms that are single exponential in
... read more