The following pages link to (Q3128894):
Displaying 17 items.
- A note on approximation of the vertex cover and feedback vertex set problems -- Unified approach (Q671377) (← links)
- Dynamic parameterized problems (Q722546) (← links)
- A unified approximation algorithm for node-deletion problems (Q1270821) (← links)
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs (Q1273087) (← links)
- Approximating minimum feedback vertex sets in hypergraphs (Q1583598) (← links)
- A justification of local conditioning in Bayesian networks (Q1605678) (← links)
- The integrity of a cubic graph (Q1827848) (← links)
- Solving the feedback vertex set problem on undirected graphs (Q1975362) (← links)
- Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem (Q2171258) (← links)
- A constraint programming approach to cutset problems (Q2489126) (← links)
- Local conditioning in Bayesian networks (Q2676575) (← links)
- A Linear Kernel for Planar Feedback Vertex Set (Q3503587) (← links)
- A primal-dual approach to approximation of node-deletion problems for matroidal properties (Q4572003) (← links)
- Primal-dual approximation algorithms for feedback problems in planar graphs (Q4645920) (← links)
- On approximation properties of the Independent set problem for degree 3 graphs (Q5057456) (← links)
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis (Q5963653) (← links)
- Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs (Q6487955) (← links)
