Pages that link to "Item:Q2171258"
From MaRDI portal
The following pages link to Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem (Q2171258):
Displaying 33 items.
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- On feedback vertex set: new measure and new structures (Q494933) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Using fractional primal-dual to schedule split intervals with demands (Q865744) (← links)
- Combinatorial algorithms for feedback problems in directed graphs (Q1007586) (← links)
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs (Q1273087) (← links)
- A justification of local conditioning in Bayesian networks (Q1605678) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- A faster parameterized algorithm for pseudoforest deletion (Q1693129) (← links)
- Polynomial kernels for deletion to classes of acyclic digraphs (Q1751231) (← links)
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- The size of graphs with given feedback vertex number (Q2127624) (← links)
- Local search is a PTAS for feedback vertex set in minor-free graphs (Q2197532) (← links)
- An approximation algorithm for the \(l\)-pseudoforest deletion problem (Q2285146) (← links)
- Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
- Parameterized complexity of secluded connectivity problems (Q2408560) (← links)
- Meta-kernelization using well-structured modulators (Q2413976) (← links)
- Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT (Q2632009) (← links)
- Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
- Circumventing connectivity for kernelization (Q2692730) (← links)
- A Linear Kernel for Planar Feedback Vertex Set (Q3503587) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- Hitting Weighted Even Cycles in Planar Graphs (Q5048307) (← links)
- Tight Localizations of Feedback Sets (Q5102049) (← links)
- (Q5111250) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
- Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) (← links)
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
- Approximability of the independent feedback vertex set problem for bipartite graphs (Q5919046) (← links)
- Minimum <i>k</i>‐cores and the <i>k</i>‐core polytope (Q6087566) (← links)
- Atomic cross-chain swaps with improved space and local time complexity (Q6536334) (← links)
- Delaying decisions and reservation costs (Q6591489) (← links)
- Approximating power node-deletion problems (Q6593676) (← links)
