Faster deterministic parameterized algorithm for k-PATH

Research output: Contribution to journalArticlepeer-review

18 Scopus citations


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 languageEnglish
Pages (from-to)96-104
Number of pages9
JournalTheoretical Computer Science
StatePublished - 22 Oct 2019


  • Graph algorithms
  • Parameterized complexity
  • k-PATH

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Faster deterministic parameterized algorithm for k-PATH'. Together they form a unique fingerprint.

Cite this