Searching for authors named "Serge Gaspers" – sorted by Relevance.
5 documents found, showing 1 through 5.
-
Exponential Time Algorithms: Structures, Measures, and
- …This thesis studies exponential time algorithms, more precisely, algorithms exactly solving problems for which no polynomial time algorithm is known and likely to exist. Interested in worst–case upper bounds on the running times, several known techniques to design and analyze such algorithms are sur…
- Add To MetaCart
-
A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs
- …An independent dominating set D of a graph G = (V, E) is a subset of vertices such that every vertex in V \ D has at least one neighbour in D and D is an independent set, i.e. no two vertices in D are adjacent. Finding a minimum independent dominating set in a graph is an NP-hard problem. Whereas it…
- Cited by 1 (0 self) – Add To MetaCart
-
Branching and treewidth based exact algorithms
- …Abstract. Branch & Reduce and dynamic programming on graphs of bounded treewidth are among the most common and powerful techniques used in the design of exact (exponential time) algorithms for NP hard problems. In this paper we discuss the eÆciency of simple algorithms based on combinations of these…
- Cited by 4 (1 self) – Add To MetaCart
-
On the minimum feedback vertex set problem: Exact and enumeration algorithms ∗
- …We present a time O(1.7548 n) algorithm finding a minimum feedback vertex set in an undirected graph on n vertices. We also prove that a graph on n vertices can contain at most 1.8638 n minimal feedback vertex sets and that there exist graphs having 105 n/10 ≈ 1.5926 n minimal feedback vertex sets.…
- Add To MetaCart
-
Finding a minimum feedback vertex set in time O(1.7548 n
- …We present an O(1.7548 n) algorithm finding a minimum feedback vertex set in a graph on n vertices.…
- Cited by 8 (3 self) – Add To MetaCart
Showing 1 through 5.
