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
N1 - Publisher Copyright:
© 2018 Elsevier B.V.
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 - http://www.scopus.com/inward/record.url?scp=85051133815&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2018.04.018
DO - 10.1016/j.ipl.2018.04.018
M3 - Article
AN - SCOPUS:85051133815
VL - 140
SP - 8
EP - 12
JO - Information Processing Letters
JF - Information Processing Letters
SN - 0020-0190
ER -