Header menu link for other important links
X
Long directed (s,t)-path: FPT algorithm
F.V. Fomin, D. Lokshtanov, , S. Saurabh, M. Zehavi
Published in Elsevier B.V.
2018
Volume: 140
   
Pages: 8 - 12
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. © 2018 Elsevier B.V.
About the journal
JournalData powered by TypesetInformation Processing Letters
PublisherData powered by TypesetElsevier B.V.
ISSN00200190