Pages that link to "Item:Q4210077"
From MaRDI portal
The following pages link to Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference (Q4210077):
Displaying 50 items.
- Feedback vertex set in hypercubes (Q294845) (← links)
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
- On the decycling number of generalized Kautz digraphs (Q477628) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs (Q705040) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- Feedback numbers of Kautz digraphs (Q879335) (← links)
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- Feedback numbers of de Bruijn digraphs (Q980262) (← links)
- An efficient algorithm for minimum feedback vertex sets in rotator graphs (Q987789) (← links)
- Combinatorial algorithms for feedback problems in directed graphs (Q1007586) (← links)
- Minimum feedback vertex sets in shuffle-based interconnection networks (Q1007599) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- New bounds on the size of the minimum feedback vertex set in meshes and butterflies. (Q1853082) (← links)
- The decycling number of outerplanar graphs (Q1956257) (← links)
- New formulae for the bipartite vertex frustration and decycling number of graphs (Q2008493) (← links)
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem (Q2028800) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- The size of graphs with given feedback vertex number (Q2127624) (← links)
- On the feedback number of 3-uniform linear extremal hypergraphs (Q2150590) (← links)
- The power of linear-time data reduction for maximum matching (Q2211355) (← links)
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles (Q2296552) (← links)
- Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
- Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
- Feedback vertex sets in mesh-based networks (Q2383604) (← links)
- New upper bounds on feedback vertex numbers in butterflies (Q2390267) (← 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)
- Fixed parameterized algorithms for generalized feedback vertex set problems (Q2693637) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- Safe Approximation and Its Relation to Kernelization (Q2891346) (← links)
- Deterministic Algorithms for the Independent Feedback Vertex Set Problem (Q2946071) (← links)
- Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
- New bounds on the decycling number of generalized de Bruijn digraphs (Q4595251) (← links)
- (Q5009491) (← links)
- On the Complexity of Singly Connected Vertex Deletion (Q5041193) (← links)
- Decycling bipartite graphs (Q5084689) (← links)
- (Q5111250) (← links)
- The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)
- Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
- Tracking Paths (Q5283356) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
- (Q5743499) (← links)
- (Q5743513) (← links)
- Parameterized aspects of triangle enumeration (Q5915757) (← links)
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
- Constant factor approximation for tracking paths and fault tolerant feedback vertex set (Q5918533) (← links)
- Constant factor approximation for tracking paths and fault tolerant feedback vertex set (Q5925624) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)