Abstract
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.554k). This improves the previously best deterministic algorithm for this problem of Zehavi [ESA 2015] whose time complexity is O⁎(2.597k). 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.
Original language | American English |
---|---|
Pages (from-to) | 96-104 |
Number of pages | 9 |
Journal | Theoretical Computer Science |
Volume | 790 |
DOIs | |
State | Published - 22 Oct 2019 |
Keywords
- Graph algorithms
- Parameterized complexity
- k-PATH
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- General Computer Science