Long directed (s,t)-path: FPT algorithm

Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi

Research output: Contribution to journalArticlepeer-review

18 Scopus citations


Given a digraph G, two vertices s,t∈V(G) and a non-negative integer k, the LONG DIRECTED (s,t)-PATH problem asks whether G has a path of length at least k from s to t. We present a simple algorithm that solves LONG DIRECTED (s,t)-PATH in time O(4.884k). This results also in an improvement upon the previous fastest algorithm for LONG DIRECTED CYCLE.

Original languageEnglish
Pages (from-to)8-12
Number of pages5
JournalInformation Processing Letters
StatePublished - 1 Dec 2018


  • Long directed (s,t)-path
  • Long directed cycle
  • Parameterized algorithm

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'Long directed (s,t)-path: FPT algorithm'. Together they form a unique fingerprint.

Cite this