Publication:3395987
From MaRDI portal
zbMath1169.68443MaRDI QIDQ3395987
Publication date: 15 September 2009
Related Items
Exact algorithms for dominating set, Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time, Solving connected dominating set faster than \(2^n\), On solving sparse algebraic equations over finite fields, On two techniques of combining branching and treewidth, Exact algorithms for edge domination, Improved agreeing-gluing algorithm, Treewidth computation and extremal combinatorics, A combinatorial problem related to sparse systems of equations, Sparse Boolean equations and circuit lattices, An exact algorithm for the minimum dominating clique problem, Exact Algorithms for Edge Domination