2023
DOI: 10.48550/arxiv.2301.02421
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Simpler and faster algorithms for detours in planar digraphs

Abstract: In the Directed Detour problem one is given a digraph G and a pair of vertices s and t, and the task is to decide whether there is a directed simple path from s to t in G whose length is larger than dist G (s, t). The more general parameterized variant, Directed Long Detour, asks for a simple s-to-t path of length at least dist G (s, t) + k, for a given parameter k. Surprisingly, it is still unknown whether Directed Detour is polynomial-time solvable on general digraphs. However, for planar digraphs, Wu and Wa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

1
0
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 6 publications
1
0
0
Order By: Relevance
“…What is more, our approach yields an arguably simpler proof. * It has recently come to our attention that a similar result is given in [15]. Our work was conducted independently of this work.…”
supporting
confidence: 68%
“…What is more, our approach yields an arguably simpler proof. * It has recently come to our attention that a similar result is given in [15]. Our work was conducted independently of this work.…”
supporting
confidence: 68%