2000 character limit reached
Faster deterministic parameterized algorithm for k-Path
Published 13 Aug 2018 in cs.DS | (1808.04185v2)
Abstract: In the k-Path problem, the input is a directed graph and an integer , and the goal is to decide whether there is a simple directed path in with exactly vertices. We give a deterministic algorithm for k-Path with time complexity . This improves the previously best deterministic algorithm for this problem of Zehavi [ESA 2015] whose time complexity is . The technique used by our algorithm can also be used to obtain faster deterministic algorithms for k-Tree, r-Dimensional k-Matching, Graph Motif, and Partial Cover.
Paper Prompts
Sign up for free to create and run prompts on this paper.