平面有向图迂回问题的一种简便快速算法
Simpler and faster algorithms for detours in planar digraphs
摘要:
在有向迂回问题中,给定一个有向图$G$和一对顶点$s$和~ $t$,判定$G$中是否存在一条从$s$到$t$的有向简单路,其长度大于$\mathsf{dist}_{G}(s,t)$ .更一般的参数化变体,有向长迂回,对于给定的参数$k$,要求长度至少为$\mathsf{dist}_{G}(s,t)+k$的简单$s$到$t$路径.令人惊讶的是,它仍然是未知的,是否有向迂回多项式时间可解的一般有向图。然而,对于平面有向图,Wu和Wang~[Networks,'15]提出了一个有向迂回的$\mathcal{O}(n^3)$ -时间算法,而Fomin等人~[15]提出了一个有向迂回的算法。[STACS 2022]给出了有向长迂回的$2^{\mathcal{O}(k)}\cdot n^{\mathcal{O}(1)}$时间fpt算法。Wu和Wang的算法依赖于对平面嵌入中的短迂回看起来如何的非平凡分析,而Fomin等人的算法。基于平面有向图上$§$ -不相交路径问题的一个简化。这后一个问题是可解决的多项式时间使用Schrijver~[SIAM~ J.~压缩,~ '94],但所得到的多项式因子的次数是巨大的。在本文中,我们提出了两个简单的算法:我们展示了如何解决,在平面有向图,有向迂回时间$\mathcal{O}(n^2)$和有向长迂回时间$2^{\mathcal{O}(k)}\cdot n^4 \log n$。在这两种情况下,我们的想法是减少到$2$ -不相交的路径问题在一个平面有向图,并观察到,获得的实例,这个问题有一定的拓扑结构,使他们服从一个直接的贪婪策略。
英文摘要:
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 $\mathsf{dist}_{G}(s,t)$. The more general parameterized variant, directed long detour, asks for a simple $s$-to-$t$ path of length at least $\mathsf{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 Wang~[Networks, '15] proposed an $\mathcal{O}(n^3)$-time algorithm for directed detour, while Fomin et al.~[STACS 2022] gave a $2^{\mathcal{O}(k)}\cdot n^{\mathcal{O}(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 $\mathcal{O}(n^2)$ and directed long detour in time $2^{\mathcal{O}(k)}\cdot 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。