Papers
Topics
Authors
Recent
Search
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 GG and an integer k≥1k\geq 1, and the goal is to decide whether there is a simple directed path in GG with exactly kk vertices. We give a deterministic algorithm for k-Path with time complexity O∗(2.554k)O^*(2.554^k). This improves the previously best deterministic algorithm for this problem of Zehavi [ESA 2015] whose time complexity is O∗(2.597k)O^*(2.597^k). 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.

Authors (1)
Citations (22)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.