May 9, 2017 · We established exact exponential algorithms to solve the Tropical Connected Set problem: an ⁎ O ⁎ ( 1.5359 n ) time algorithm for general graphs ...
Dec 3, 2014 · 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 ...
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 ...
We study exact exponential algorithms to solve Tropical Connected Set. We present an O(1.5359n) time algorithm for general graphs and an O(1.2721n) time ...
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 ...
TL;DR: In this paper, a fast exact algorithm for the problem of computing a minimum dominating set in undirected graphs is presented. But the complexity of the ...
To the best of our knowledge, the unique paper to study exact exponential time algorithms within a variant of Graph Motif is the one by Dondi et al. [11].
Apr 7, 2020 · 1 Exact exponential algorithms to find tropical connected sets of minimum size. 2 Enumerating Minimal Tropical Connected Sets. 3 Algorithm ...
Jun 25, 2022 · Exact exponential algorithms to find tropical connected sets of minimum size ; Mathieu Chapelle · Université libre de Bruxelles ; Manfred Cochefert.
Tropical Connected Set is strongly related to the Graph Motif problem which deals with vertex-colored graphs. Graph Motif has various applications in biology ...