Simpler and faster algorithms for detours in planar digraphs

01/06/2023
by   Meike Hatzel, et al.
0

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 𝖽𝗂𝗌𝗍_G(s,t). The more general parameterized variant, directed long detour, asks for a simple s-to-t path of length at least 𝖽𝗂𝗌𝗍_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 Wang [Networks, '15] proposed an 𝒪(n^3)-time algorithm for directed detour, while Fomin et al. [STACS 2022] gave a 2^𝒪(k)· n^𝒪(1)-time fpt algorithm for directed long detour. The algorithm of Wu and Wang relies on a nontrivial analysis of how short detours may look like in a plane embedding, while the algorithm of Fomin et al. is based on a reduction to the -disjoint paths problem on planar digraphs. This latter problem is solvable in polynomial time using the algebraic machinery of Schrijver [SIAM J. Comp., '94], but the degree of the obtained polynomial factor is huge. In this paper we propose two simple algorithms: we show how to solve, in planar digraphs, directed detour in time 𝒪(n^2) and directed long detour in time 2^𝒪(k)· n^4 log n. In both cases, the idea is to reduce to the 2-disjoint paths problem in a planar digraph, and to observe that the obtained instances of this problem have a certain topological structure that makes them amenable to a direct greedy strategy.

READ FULL TEXT
research
01/15/2023

Long Directed Detours: Reduction to 2-Disjoint Paths

We study an "above guarantee" version of the Longest Path problem in dir...
research
01/10/2022

Detours in Directed Graphs

We study two "above guarantee" versions of the classical Longest Path pr...
research
10/21/2022

Rerouting Planar Curves and Disjoint Paths

In this paper, we consider a transformation of k disjoint paths in a gra...
research
08/11/2022

Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification

In the Directed Steiner Network problem, the input is a directed graph G...
research
10/12/2020

Incomplete Directed Perfect Phylogeny in Linear Time

Reconstructing the evolutionary history of a set of species is a central...
research
06/20/2018

Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm

Given an undirected graph and two disjoint vertex pairs s_1,t_1 and s_2,...
research
11/04/2021

The Shortest Even Cycle Problem is Tractable

Given a directed graph, we show how to efficiently find a shortest (dire...

Please sign up or login with your details

Forgot password? Click here to reset