Combinatorica
On generating all maximal independent sets
Information Processing Letters
Recent problems and results about kernels in directed graphs
Discrete Mathematics - Topics on domination
A graph-theoretic approach to default logic
Information and Computation
Theoretical Computer Science
Graph theoretical structures in logic programs and default theories
Theoretical Computer Science
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A lower bound for DLL algorithms for k-SAT (preliminary version)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A machine program for theorem-proving
Communications of the ACM
An Overview of Backtrack Search Satisfiability Algorithms
Annals of Mathematics and Artificial Intelligence
On kernels, defaults and even graphs
Annals of Mathematics and Artificial Intelligence
Journal of Computer and System Sciences
A fixed-parameter algorithm for the directed feedback vertex set problem
Journal of the ACM (JACM)
Depth-first search and linear grajh algorithms
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Efficient CNF simplification based on binary implication graphs
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Hi-index | 0.00 |
We begin by offering a new, direct proof of the equivalence between the problem of the existence of kernels in digraphs, KER, and satisfiability of propositional theories, SAT, giving linear reductions in both directions. Having introduced some linear reductions of the input graph, we present new algorithms for KER, with variations utilizing solvers of boolean equations. In the worst case, the algorithms try all assignments to either a feedback vertex set, F, or a set of nodes E touching only all even cycles. Hence KER is fixed parameter tractable not only in the size of F, as observed earlier, but also in the size of E. A slight modification of these algorithms leads to a branch and bound algorithm for KER which is virtually identical to the DPLL algorithm for SAT. This suggests deeper analogies between the two problems and the probable scenario of KER research facing the challenges known from the work on SAT. The algorithm gives also the upper bound O^@?(1.427^|^G^|) on the time complexity of general KER and O^@?(1.286^|^G^|) of KER for oriented graphs, where |G| is the number of vertices.