Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Hait, Soumita"'
The Euclidean Steiner Minimal Tree problem takes as input a set $\mathcal P$ of points in the Euclidean plane and finds the minimum length network interconnecting all the points of $\mathcal P$. In this paper, in continuation to the works of Du et al
Externí odkaz:
http://arxiv.org/abs/2307.00254
Assume we are given a graph $G$, two independent sets $S$ and $T$ in $G$ of size $k \geq 1$, and a positive integer $\ell \geq 1$. The goal is to decide whether there exists a sequence $\langle I_0, I_1, ..., I_\ell \rangle$ of independent sets such
Externí odkaz:
http://arxiv.org/abs/2209.05145
Publikováno v:
In Journal of Computer and System Sciences February 2025 147
