3 results
Search Results
2. Exact algorithms for dominating set
- Author
-
van Rooij, Johan M.M. and Bodlaender, Hans L.
- Subjects
- *
DOMINATING set , *COMPUTER-aided design , *ALGORITHMS , *MATHEMATICAL proofs , *COMBINATORICS , *SET theory , *MATHEMATICAL analysis , *POLYNOMIALS - Abstract
Abstract: The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems like Dominating Set and Independent Set. This approach is used in this paper to obtain a faster exact algorithm for Dominating Set. We obtain this algorithm by considering a series of branch and reduce algorithms. This series is the result of an iterative process in which a mathematical analysis of an algorithm in the series with measure and conquer results in a convex or quasiconvex programming problem. The solution, by means of a computer, to this problem not only gives a bound on the running time of the algorithm, but can also give an indication on where to look for a new reduction rule, often giving a new, possibly faster algorithm. As a result, we obtain an time and polynomial space algorithm. [Copyright &y& Elsevier]
- Published
- 2011
- Full Text
- View/download PDF
3. Branchwidth of chordal graphs
- Author
-
Paul, Christophe and Telle, Jan Arne
- Subjects
- *
MATHEMATICAL decomposition , *GRAPH theory , *GRAPH algorithms , *SET theory , *TREE graphs , *POLYNOMIALS , *MATHEMATICAL analysis - Abstract
Abstract: This paper revisits the ‘branchwidth territories’ of Kloks, Kratochvíl and Müller [T. Kloks, J. Kratochvíl, H. Müller, New branchwidth territories, in: 16th Ann. Symp. on Theoretical Aspect of Computer Science, STACS, in: Lecture Notes in Computer Science, vol. 1563, 1999, pp. 173–183] to provide a simpler proof, and a faster algorithm for computing the branchwidth of an interval graph. We also generalize the algorithm to the class of chordal graphs, albeit at the expense of exponential running time. Compliance with the ternary constraint of the branchwidth definition is facilitated by a simple new tool called -troikas: three sets of size at most each are a -troika of set , if any two have union . We give a straightforward algorithm, computing branchwidth for an interval graph on edges, vertices and maximal cliques. We also prove a conjecture of Mazoit [F. Mazoit, A general scheme for deciding the branchwidth, Technical Report RR2004-34, LIP — École Normale Supérieure de Lyon, 2004. http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2004/RR2004-34.pdf], by showing that branchwidth can be computed in polynomial time for a chordal graph given with a clique tree having a polynomial number of subtrees. [Copyright &y& Elsevier]
- Published
- 2009
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.