Kernelization for counting problems on graphs: preserving the number of minimum solutions
From MaRDI portal
Cites work
- (Meta) kernelization
- A 4k^2 kernel for feedback vertex set
- Algorithms and Data Structures
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- Bidimensionality and kernels
- Compactors for parameterized counting problems
- Data-compression for parametrized counting problems on sparse graphs
- Dempster's rule of combination is {\#}P-complete
- Fast convergence of the Glauber dynamics for sampling independent sets
- Homomorphisms are a good basis for counting small subgraphs
- scientific article; zbMATH DE number 7075922 (Why is no real title available?)
- Kernelization. Theory of parameterized preprocessing
- Kernelizations for Parameterized Counting Problems
- Linear-time kernelization for feedback vertex set
- Nondeterminism within $P^ * $
- On feedback vertex set: new measure and new structures
- On the hardness of approximate reasoning
- Parameterized algorithms
- Parameterized counting problems
- Polynomial-Time Approximation Algorithms for the Ising Model
- Polynomial-time data reduction for dominating set
- PP is as Hard as the Polynomial-Time Hierarchy
- The complexity of computing the permanent
- The Parameterized Complexity of Counting Problems
Cited in
(4)
This page was built for publication: Kernelization for counting problems on graphs: preserving the number of minimum solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6926182)
