Enumeration of minimal hitting sets parameterized by treewidth
From MaRDI portal
Cites work
- A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
- A Practical Approach to Courcelle's Theorem
- A recognition algorithm for the intersection graphs of directed paths in directed trees
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- Computational aspects of monotone dualization: a brief survey
- Counting and enumerating preferred database repairs
- Covers of Query Results
- Database Repairing and Consistent Query Answering
- Degrees of acyclicity for hypergraphs and relational database schemes
- Easy problems for tree-decomposable graphs
- Efficient algorithms for dualizing large-scale hypergraphs
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- Generalized finite automata theory with an application to a decision problem of second-order logic
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 1931696 (Why is no real title available?)
- scientific article; zbMATH DE number 7204563 (Why is no real title available?)
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Linear delay enumeration and monadic second-order logic
- Minimal-change integrity maintenance using tuple deletions
- Monadic Datalog over finite structures of bounded treewidth
- MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
- New Results on Monotone Dualization and Generating Hypergraph Transversals
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- On the enumeration of minimal dominating sets and related notions
- On the model-checking of monadic second-order formulas with edge set quantifications
- Parameterized algorithms
- Parametrized complexity theory.
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Query evaluation via tree-decompositions
- Slightly superexponential parameterized problems
- Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs
- The complexity of first-order and monadic second-order logic revisited
- The Complexity of Translating Logic to Finite Automata
- The minimal hitting set generation problem: algorithms and computation
- Tree acceptors and some of their applications
- Treewidth. Computations and approximations
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation
This page was built for publication: Enumeration of minimal hitting sets parameterized by treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7292773)
