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

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

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters Vol. 140; pp. 8 - 12
Main Authors: Fomin, Fedor V., Lokshtanov, Daniel, Panolan, Fahad, Saurabh, Saket, Zehavi, Meirav
Format: Journal Article
Language:English
Published: Elsevier B.V 01.12.2018
Subjects:
Long directed ([formula omitted])-path
Long directed cycle
Parameterized algorithm
Long directed (s,t)-path
Parameterized algorithm
Long directed cycle
ISSN:0020-0190, 1872-6119
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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. •Single-exponential time parameterized algorithm for long directed (s, t)-path.•The algorithm is simple and intuitive.•Consequently, we also obtain an improvement for long directed cycle.
AbstractList 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. •Single-exponential time parameterized algorithm for long directed (s, t)-path.•The algorithm is simple and intuitive.•Consequently, we also obtain an improvement for long directed cycle.
Author Lokshtanov, Daniel
Fomin, Fedor V.
Zehavi, Meirav
Panolan, Fahad
Saurabh, Saket
Author_xml – sequence: 1
  givenname: Fedor V.
  surname: Fomin
  fullname: Fomin, Fedor V.
  email: fomin@ii.uib.no
  organization: University of Bergen, Bergen, Norway
– sequence: 2
  givenname: Daniel
  surname: Lokshtanov
  fullname: Lokshtanov, Daniel
  email: daniello@ii.uib.no
  organization: University of Bergen, Bergen, Norway
– sequence: 3
  givenname: Fahad
  surname: Panolan
  fullname: Panolan, Fahad
  email: fahad.panolan@ii.uib.no
  organization: University of Bergen, Bergen, Norway
– sequence: 4
  givenname: Saket
  surname: Saurabh
  fullname: Saurabh, Saket
  email: saket@imsc.res.in
  organization: University of Bergen, Bergen, Norway
– sequence: 5
  givenname: Meirav
  surname: Zehavi
  fullname: Zehavi, Meirav
  email: meiravze@bgu.ac.il
  organization: Ben-Gurion University, Beersheba, Israel
BookMark eNp9kEFLwzAYhoNMsJv-AG-9qWDr97U1afU0hlNhoId5DumXdEvp2pEEwX9vxzx52Ok5PS8875RN-qE3jF0jpAjIH9rU7rs0AyxTKNIRZyzCUmQJR6wmLALIIAGs4IJNvW8BgBe5iNjNaug3sbbOUDA6vvX34S7Zq7B9ipef61h1m8HZsN1dsvNGdd5c_XHGvpYv68Vbsvp4fV_MVwlllQhJrQlNBtoIbnKEOi95VdSgG4018SbDknIi_siRBKmGY1kgai1ANIpXpshnTBx3yQ3eO9NIskEFO_TBKdtJBHnola0ce-WhV0IhR4wm_jP3zu6U-znpPB8dMyZ9W-OkJ2t6MsdDpB7sCfsXYGduXQ
CitedBy_id crossref_primary_10_1016_j_jcss_2023_05_001
crossref_primary_10_1137_23M1558008
crossref_primary_10_1145_3439721
crossref_primary_10_1016_j_tcs_2019_04_024
crossref_primary_10_1002_net_22014
crossref_primary_10_1016_j_tcs_2019_07_009
crossref_primary_10_1016_j_ipl_2024_106491
crossref_primary_10_1109_TKDE_2025_3532318
crossref_primary_10_1145_3460956
crossref_primary_10_1145_3588915
crossref_primary_10_1145_3674835
crossref_primary_10_1137_19M1290577
Cites_doi 10.1016/j.ipl.2008.11.004
10.1016/j.jcss.2015.11.008
10.1145/2886094
10.1137/080716475
10.1145/1328911.1328918
10.1016/j.jcss.2017.03.003
10.1016/j.ipl.2016.02.005
ContentType Journal Article
Copyright 2018 Elsevier B.V.
Copyright_xml – notice: 2018 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.ipl.2018.04.018
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1872-6119
EndPage 12
ExternalDocumentID 10_1016_j_ipl_2018_04_018
S002001901830111X
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29I
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABEFU
ABFNM
ABFSI
ABJNI
ABMAC
ABTAH
ABXDB
ABYKQ
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADJOM
ADMUD
AEBSH
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
E.L
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBLVA
GBOLZ
HLZ
HMJ
HVGLF
HZ~
IHE
J1W
KOM
LG9
M26
M41
MO0
MS~
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SDP
SES
SEW
SME
SPC
SPCBC
SSV
SSZ
T5K
TN5
UQL
WH7
WUQ
XPP
ZMT
ZY4
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c297t-bdc1e20de76e310b38694b0dfd1bc6f218c3cc6561c7caf618411dd707fa69e43
ISICitedReferencesCount 21
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000445992100003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0020-0190
IngestDate Sat Nov 29 07:26:59 EST 2025
Tue Nov 18 22:09:45 EST 2025
Fri Feb 23 02:50:25 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Long directed (s,t)-path
Parameterized algorithm
Long directed cycle
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c297t-bdc1e20de76e310b38694b0dfd1bc6f218c3cc6561c7caf618411dd707fa69e43
PageCount 5
ParticipantIDs crossref_citationtrail_10_1016_j_ipl_2018_04_018
crossref_primary_10_1016_j_ipl_2018_04_018
elsevier_sciencedirect_doi_10_1016_j_ipl_2018_04_018
PublicationCentury 2000
PublicationDate December 2018
2018-12-00
PublicationDateYYYYMMDD 2018-12-01
PublicationDate_xml – month: 12
  year: 2018
  text: December 2018
PublicationDecade 2010
PublicationTitle Information processing letters
PublicationYear 2018
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Zehavi (br0090) 2015
Chen, Kneis, Lu, Molle, Richter, Rossmanith, Sze, Zhang (br0020) 2009; 38
Zehavi (br0100) 2016; 116
Björklund, Husfeldt, Kaski, Koivisto (br0010) 2017; 87
Gabow, Nie (br0060) 2008; 4
Shachnai, Zehavi (br0070) 2016; 82
Fomin, Lokshtanov, Saurabh (br0050) 2014
Fomin, Lokshtanov, Panolan, Saurabh (br0040) 2016; 63
Fomin, Lokshtanov, Panolan, Saurabh (br0030) 2014
Williams (br0080) 2009; 109
Zehavi (10.1016/j.ipl.2018.04.018_br0090) 2015
Chen (10.1016/j.ipl.2018.04.018_br0020) 2009; 38
Fomin (10.1016/j.ipl.2018.04.018_br0050) 2014
Fomin (10.1016/j.ipl.2018.04.018_br0040) 2016; 63
Gabow (10.1016/j.ipl.2018.04.018_br0060) 2008; 4
Williams (10.1016/j.ipl.2018.04.018_br0080) 2009; 109
Fomin (10.1016/j.ipl.2018.04.018_br0030) 2014
Björklund (10.1016/j.ipl.2018.04.018_br0010) 2017; 87
Zehavi (10.1016/j.ipl.2018.04.018_br0100) 2016; 116
Shachnai (10.1016/j.ipl.2018.04.018_br0070) 2016; 82
References_xml – start-page: 142
  year: 2014
  end-page: 151
  ident: br0050
  article-title: Efficient computation of representative sets with applications in parameterized and exact algorithms
  publication-title: SODA
– volume: 4
  year: 2008
  ident: br0060
  article-title: Finding a long directed cycle
  publication-title: ACM Trans. Algorithms
– volume: 38
  start-page: 2526
  year: 2009
  end-page: 2547
  ident: br0020
  article-title: Randomized divide-and-conquer: improved path, matching, and packing algorithms
  publication-title: SIAM J. Comput.
– volume: 63
  start-page: 1
  year: 2016
  end-page: 60
  ident: br0040
  article-title: Efficient computation of representative families with applications in parameterized and exact algorithms
  publication-title: J. ACM
– volume: 87
  start-page: 119
  year: 2017
  end-page: 139
  ident: br0010
  article-title: Narrow sieves for parameterized paths and packings
  publication-title: J. Comput. Syst. Sci.
– start-page: 443
  year: 2014
  end-page: 454
  ident: br0030
  article-title: Representative sets of product families
  publication-title: ESA
– start-page: 1037
  year: 2015
  end-page: 1049
  ident: br0090
  article-title: Mixing color coding-related techniques
  publication-title: ESA
– volume: 116
  start-page: 419
  year: 2016
  end-page: 422
  ident: br0100
  article-title: A randomized algorithm for long directed cycle
  publication-title: Inf. Process. Lett.
– volume: 82
  start-page: 488
  year: 2016
  end-page: 502
  ident: br0070
  article-title: Representative families: a unified tradeoff-based approach
  publication-title: J. Comput. Syst. Sci.
– volume: 109
  start-page: 315
  year: 2009
  end-page: 318
  ident: br0080
  article-title: Finding paths of length
  publication-title: Inf. Process. Lett.
– start-page: 1037
  year: 2015
  ident: 10.1016/j.ipl.2018.04.018_br0090
  article-title: Mixing color coding-related techniques
– start-page: 142
  year: 2014
  ident: 10.1016/j.ipl.2018.04.018_br0050
  article-title: Efficient computation of representative sets with applications in parameterized and exact algorithms
– volume: 109
  start-page: 315
  issue: 6
  year: 2009
  ident: 10.1016/j.ipl.2018.04.018_br0080
  article-title: Finding paths of length k in O⁎(2k) time
  publication-title: Inf. Process. Lett.
  doi: 10.1016/j.ipl.2008.11.004
– start-page: 443
  year: 2014
  ident: 10.1016/j.ipl.2018.04.018_br0030
  article-title: Representative sets of product families
– volume: 82
  start-page: 488
  issue: 3
  year: 2016
  ident: 10.1016/j.ipl.2018.04.018_br0070
  article-title: Representative families: a unified tradeoff-based approach
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1016/j.jcss.2015.11.008
– volume: 63
  start-page: 1
  issue: 4
  year: 2016
  ident: 10.1016/j.ipl.2018.04.018_br0040
  article-title: Efficient computation of representative families with applications in parameterized and exact algorithms
  publication-title: J. ACM
  doi: 10.1145/2886094
– volume: 38
  start-page: 2526
  issue: 6
  year: 2009
  ident: 10.1016/j.ipl.2018.04.018_br0020
  article-title: Randomized divide-and-conquer: improved path, matching, and packing algorithms
  publication-title: SIAM J. Comput.
  doi: 10.1137/080716475
– volume: 4
  issue: 1
  year: 2008
  ident: 10.1016/j.ipl.2018.04.018_br0060
  article-title: Finding a long directed cycle
  publication-title: ACM Trans. Algorithms
  doi: 10.1145/1328911.1328918
– volume: 87
  start-page: 119
  year: 2017
  ident: 10.1016/j.ipl.2018.04.018_br0010
  article-title: Narrow sieves for parameterized paths and packings
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1016/j.jcss.2017.03.003
– volume: 116
  start-page: 419
  issue: 6
  year: 2016
  ident: 10.1016/j.ipl.2018.04.018_br0100
  article-title: A randomized algorithm for long directed cycle
  publication-title: Inf. Process. Lett.
  doi: 10.1016/j.ipl.2016.02.005
SSID ssj0006437
Score 2.3120573
Snippet 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...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 8
SubjectTerms Long directed ([formula omitted])-path
Long directed cycle
Parameterized algorithm
Title Long directed (s,t)-path: FPT algorithm
URI https://dx.doi.org/10.1016/j.ipl.2018.04.018
Volume 140
WOSCitedRecordID wos000445992100003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-6119
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0006437
  issn: 0020-0190
  databaseCode: AIEXJ
  dateStart: 19950113
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3NT9swFLe2woELMD7E16YcJsGAVHGTxvZuCFFt04Q4dKi3yHEcWihJ1QbUP5_3YictsCFA2iWtkjpt_F6ff35fP0K-elooBUDfVYKHbqB025WCKZfzdsAkhSU4lCXZBDs_572euLApQZOSToBlGZ9Oxei_ihrOgbCxdPYN4q5vCifgPQgdjiB2OL5K8L-RPcisVLr0EKCkwNQKF9mH0QPQuegeyeFVPh4U_dt5dGprk0qVGJkKAvQkDMuSn1mhSH5rGg90kKbk6LJZJ_XkN5M-gM38fla8PgtRZbCJNsNkXya1Z0fejWXcN87pG1uNbb0QlD_J6HheHmNLBTDrzfCBNrWxsJy1YL9q7WRlgk3LJmtE-dxqbHKsn9l543K4bg5GGD6ivGxXaw354_bZGI1GHAtX0ZbR3key0GJtARZw4eTnWe9XvW5jCNMkBJkfXcXAy2zAJ1_0dxQzh0y6q2TZbimcE6MKn8gHna2RlYquw7HWe53so2Y4lWY4B5Pj4lupE98d0Ain1ogN8qdz1j394VqeDFe1BCvcOFFUt7xEs1ADWo99Hoog9pI0obEKUwBxyoc_JCBlxZRMkeKH0iRhHktlKHTgb5JGlmd6izicSsD3UrZliCQsNPbjMJWS61hpQVN_m3jVc0fKNpFHLpNhVGULXkcwVRFOVeQFEbxsk8N6yMh0UHnpw0E1mZGFgGZaIpD8v4ftvG_YLlma6fIeaRTjO_2ZLKr7YjAZf7H68QCUv3pO
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Long+directed+%28s%2Ct%29-path%3A+FPT+algorithm&rft.jtitle=Information+processing+letters&rft.au=Fomin%2C+Fedor+V.&rft.au=Lokshtanov%2C+Daniel&rft.au=Panolan%2C+Fahad&rft.au=Saurabh%2C+Saket&rft.date=2018-12-01&rft.pub=Elsevier+B.V&rft.issn=0020-0190&rft.eissn=1872-6119&rft.volume=140&rft.spage=8&rft.epage=12&rft_id=info:doi/10.1016%2Fj.ipl.2018.04.018&rft.externalDocID=S002001901830111X
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0190&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0190&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0190&client=summon