Faster deterministic parameterized algorithm for k-Path

08/13/2018

∙

by   Dekel Tsur, et al.

∙

0

∙

share

In the k-Path problem, the input is a directed graph G and an integer k≥ 1, and the goal is to decide whether there is a simple directed path in G with exactly k vertices. We give a deterministic algorithm for k-Path with time complexity O^*(2.554^k). This improves the previously best deterministic algorithm for this problem of Zehavi [ESA 2015] whose time complexity is O^*(2.597^k).