Results 1  10
of
16,522
Exact Algorithms for LOOP CUTSET
"... The LOOP CUTSET problem was historically posed by Pearl as a subroutine in Pearl’s algorithm for computing inference in probabilistic networks. The efficiency of the algorithm that solves the probabilistic inference highly depends on the size of the smallest known LOOP CUTSET. This justifies the sea ..."
Abstract
 Add to MetaCart
the search for exact algorithms for finding a minimum LOOP CUTSET. In this thesis we are investigating the algorithmic complexity of the problem. We will look at both the unparameterized problem and the problem parameterized by the treewidth of the input graph. For both we give an exact exponential time
Exact Algorithms for Kayles
, 2011
"... In the game of Kayles, two players select alternatingly a vertex from a given graph G, but may never choose a vertex that is adjacent or equal to an already chosen vertex. The last player that can select a vertex wins the game. In this paper, we give an exact algorithm to determine which player has ..."
Abstract
 Add to MetaCart
In the game of Kayles, two players select alternatingly a vertex from a given graph G, but may never choose a vertex that is adjacent or equal to an already chosen vertex. The last player that can select a vertex wins the game. In this paper, we give an exact algorithm to determine which player has
On exact algorithms for treewidth
"... We give experimental and theoretical results on the problem of computing the treewidth of a graph by exact exponential time algorithms using exponential space or using only polynomial space. We first report on an implementation of a dynamic programming algorithm for computing the treewidth of a grap ..."
Abstract

Cited by 20 (7 self)
 Add to MetaCart
We give experimental and theoretical results on the problem of computing the treewidth of a graph by exact exponential time algorithms using exponential space or using only polynomial space. We first report on an implementation of a dynamic programming algorithm for computing the treewidth of a
Exact Algorithms for MAXSAT
 In 4th Int. Workshop on First order Theorem Proving
, 2003
"... The maximum satisfiability problem (MAXSAT) is stated as follows: Given Boolean formula in CNF, find a truth assignment that satisfies the maximum possible number of its clauses. MAXSAT is MAXSNPcomplete and received much attention recently. One of the challenges posed by Alber, Gramm and Nieder ..."
Abstract

Cited by 20 (7 self)
 Add to MetaCart
and Niedermeier in a recent survey paper asks: Can MAXSAT be solved in less than 2 ' "steps"? Here, n is the number of different variables in the formula and a step may take polynomial time of the input. We answered this challenge positively by showing that popular algorithm based on branch
Iterative compression and exact algorithms
 In Proc. 33rd MFCS, volume 5162 of LNCS
, 2008
"... Abstract. Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. The main purpose of this paper is to show that iterative compression can also be used in the design of exact exponential time algorithms. We exemplify our findings with algorithms for the Maxim ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Abstract. Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. The main purpose of this paper is to show that iterative compression can also be used in the design of exact exponential time algorithms. We exemplify our findings with algorithms
Exact Algorithms for Circles on the Sphere
 In Proc. 14th Annu. ACM Sympos. Comput. Geom
, 1998
"... this paper, we are concerned with oriented circles on the sphere S ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
this paper, we are concerned with oriented circles on the sphere S
Exact Algorithms for Edge Domination
, 2007
"... An edge dominating set in a graph G = (V, E) is a subset of the edges D ⊆ E such that every edge in E is adjacent or equal to some edge in D. The problem of finding an edge dominating set of minimum cardinality is NPhard. We present a faster exact exponential time algorithm for this problem. Our al ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
An edge dominating set in a graph G = (V, E) is a subset of the edges D ⊆ E such that every edge in E is adjacent or equal to some edge in D. The problem of finding an edge dominating set of minimum cardinality is NPhard. We present a faster exact exponential time algorithm for this problem. Our
Complexity and exact algorithms for multicut
 In: SOFSEM
"... Abstract. The Multicut problem is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimum set of edges or vertices whose removal disconnects each pair. We mainly focus on the case of removing vertices, where we distinguish between allowing or disallowing ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Abstract. The Multicut problem is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimum set of edges or vertices whose removal disconnects each pair. We mainly focus on the case of removing vertices, where we distinguish between allowing or disallowing the removal of terminal vertices. Complementing and refining previous results from the literature, we provide several NPcompleteness and (fixedparameter) tractability results for restricted classes of graphs such as trees, interval graphs, and graphs of bounded treewidth. 1
Results 1  10
of
16,522