scientific article; zbMATH DE number 1467487
From MaRDI portal
Publication:4488089
Recommendations
- Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
- Probabilistic inference in multiply connected belief networks using loop cutsets
- scientific article; zbMATH DE number 5547867
- An optimal approximation algorithm for Bayesian inference
- scientific article; zbMATH DE number 1003266
Cited in
(34)- A faster parameterized algorithm for pseudoforest deletion
- An improved FPT algorithm for almost forest deletion problem
- Faster deterministic \textsc{Feedback Vertex Set}
- Improved analysis of highest-degree branching for feedback vertex set
- An improved deterministic parameterized algorithm for cactus vertex deletion
- On the feedback number of 3-uniform linear extremal hypergraphs
- Quick but odd growth of cacti
- One side cut accelerated random search
- Partition-based logical reasoning for first-order and propositional theories
- Fixed parameterized algorithms for generalized feedback vertex set problems
- Circular convex bipartite graphs: feedback vertex set
- What's next? Future directions in parameterized complexity
- Random iteration algorithm for graph-directed sets
- Circular convex bipartite graphs: feedback vertex sets
- Two Hardness Results on Feedback Vertex Sets
- A Linear Kernel for Planar Feedback Vertex Set
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems
- Feedback vertex sets on restricted bipartite graphs
- On feedback vertex set: new measure and new structures
- scientific article; zbMATH DE number 7286685 (Why is no real title available?)
- A naive algorithm for feedback vertex set
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms
- Slightly superexponential parameterized problems
- Improved FPT Algorithms for Deletion to Forest-Like Structures.
- Improved FPT Algorithms for Deletion to Forest-Like Structures
- Bicriteria \textsf{FPT}-approximation algorithms for vertex deletion to bounded degeneracy graphs
- Bicriteria FPT-approximation algorithms for vertex deletion to bounded degeneracy graphs
- Sampling with a black box: faster parameterized approximation algorithms for vertex deletion problems
- Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Probabilistic inference in multiply connected belief networks using loop cutsets
- Improved algorithms for feedback vertex set problems
- A cubic kernel for feedback vertex set and loop cutset
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4488089)
