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

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

doi:10.1016/j.ipl.2018.04.018

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

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

Research output: Contribution to journal › Article › peer-review

25 Scopus citations

Abstract

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.884^k). This results also in an improvement upon the previous fastest algorithm for LONG DIRECTED CYCLE.

Original language	English
Pages (from-to)	8-12
Number of pages	5
Journal	Information Processing Letters
Volume	140
DOIs	https://doi.org/10.1016/j.ipl.2018.04.018
State	Published - 1 Dec 2018

Keywords

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

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2018.04.018

Cite this

@article{be955ad70fb347818d68f819a03c88e2,

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

abstract = "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.",

keywords = "Long directed (s,t)-path, Long directed cycle, Parameterized algorithm",

author = "Fomin, \{Fedor V.\} and Daniel Lokshtanov and Fahad Panolan and Saket Saurabh and Meirav Zehavi",

note = "Publisher Copyright: {\textcopyright} 2018 Elsevier B.V.",

year = "2018",

month = dec,

day = "1",

doi = "10.1016/j.ipl.2018.04.018",

language = "English",

volume = "140",

pages = "8--12",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Long directed (s,t)-path

T2 - FPT algorithm

AU - Fomin, Fedor V.

AU - Lokshtanov, Daniel

AU - Panolan, Fahad

AU - Saurabh, Saket

AU - Zehavi, Meirav

PY - 2018/12/1

Y1 - 2018/12/1

N2 - 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.

AB - 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.

KW - Long directed (s,t)-path

KW - Long directed cycle

KW - Parameterized algorithm

UR - https://www.scopus.com/pages/publications/85051133815

U2 - 10.1016/j.ipl.2018.04.018

DO - 10.1016/j.ipl.2018.04.018

M3 - Article

AN - SCOPUS:85051133815

SN - 0020-0190

VL - 140

SP - 8

EP - 12

JO - Information Processing Letters

JF - Information Processing Letters

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this