Zobrazeno 1 - 1
of 1
pro vyhledávání: '"05C85 (Primary) 68W05, 05C38 (Secondary)"'
Autor:
Schlotter, Ildikó
We consider the following problem that we call the Shortest Two Disjoint Paths problem: given an undirected graph $G=(V,E)$ with edge weights $w:E \rightarrow \mathbb{R}$, two terminals $s$ and $t$ in $G$, find two internally vertex-disjoint paths be
Externí odkaz:
http://arxiv.org/abs/2307.12602
