May 9, 2017 · The task is to find a connected subset S ⊆ V of minimum size such that each color of G appears in S.
The input of the Tropical Connected Set problem is a vertex-colored graph and the task is to find a connected subset of minimum size such that each color of ...
This problem is known to be NP-complete, even when restricted to trees of height at most three. We show that Tropical Connected Set on trees has no ...
Exact Exponential Algorithms to Find a Tropical Connected Set of ... - HAL
hal.science › hal-01105083
The input of the Tropical Connected Set problem is a vertex-colored graph G=(V,E) and the task is to find a connected subset $S\subseteq V$ of minimum size ...
May 9, 2017 · The task is to find a connected subset SV of minimum size such that each color of G appears in S. This problem is known to be NP-complete, even ...
Semantic Scholar extracted view of "Exact exponential algorithms to find tropical connected sets of minimum size" by Mathieu Chapelle et al.
The input of the Tropical Connected Set problem is a vertex-colored graph $$G=(V,E)$$ and the task is to find a connected subset $$S\subseteq V$$ of minimum ...
The task is to find a connected subset S ⊆ V of minimum size such that each color of G appears in S. This problem is known to be NP-complete, even when ...
The input of the Tropical Connected Set problem is a vertexcolored graph G = (V, E) and the task is to find a connected subset S ⊆ V of minimum size such ...
Apr 7, 2020 · 1 Exact exponential algorithms to find tropical connected sets of minimum size. 2 Enumerating Minimal Tropical Connected Sets. 3 Algorithm ...