Improved algorithms for feedback vertex set problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 6118220 (Why is no real title available?)
- scientific article; zbMATH DE number 5485529 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 512804 (Why is no real title available?)
- scientific article; zbMATH DE number 571325 (Why is no real title available?)
- scientific article; zbMATH DE number 1979503 (Why is no real title available?)
- scientific article; zbMATH DE number 1467487 (Why is no real title available?)
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Computing and Combinatorics
- Exact Computation of Maximum Induced Forest
- Faster fixed parameter tractable algorithms for finding feedback vertex sets
- Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$
- Finding odd cycle transversals.
- Introduction to algorithms
- ON DISJOINT CYCLES
- Parameterized and Exact Computation
Cited in
(78)- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
- Parameterised algorithms for deletion to classes of DAGs
- scientific article; zbMATH DE number 970357 (Why is no real title available?)
- A parameterized algorithm for subset feedback vertex set in tournaments
- Improved FPT Algorithms for Deletion to Forest-Like Structures.
- On compiling structured CNFs to OBDDs
- Conflict free version of covering problems on graphs: classical and parameterized
- Optimal schemes for combinatorial query problems with integer feedback
- Approximation algorithms for orienting mixed graphs
- Approximation algorithms for orienting mixed graphs
- FPT algorithms for path-transversal and cycle-transversal problems
- Towards a polynomial kernel for directed feedback vertex set
- An FPT algorithm for edge subset feedback edge set
- Towards a polynomial kernel for directed feedback vertex set
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms
- scientific article; zbMATH DE number 7286685 (Why is no real title available?)
- On parameterized independent feedback vertex set
- An improved FPT algorithm for independent feedback vertex set
- What's next? Future directions in parameterized complexity
- A tabu search heuristic based on k-diamonds for the weighted feedback vertex set problem
- Compound logics for modification problems
- Fast FAST
- A polyhedral approach to the feedback vertex set problem
- Wannabe bounded treewidth graphs admit a polynomial kernel for directed feedback vertex set
- A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem
- Enumerating minimal subset feedback vertex sets
- Improved analysis of highest-degree branching for feedback vertex set
- An improved FPT algorithm for almost forest deletion problem
- On the Complexity of Singly Connected Vertex Deletion
- FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters
- Feedback vertex sets on restricted bipartite graphs
- Algorithms and Data Structures
- FPT algorithms for connected feedback vertex set
- Tree deletion set has a polynomial kernel but no \(\mathrm{OPT}^\mathcal{O}(1)\) approximation)
- Backdoors to satisfaction
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
- Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
- Mim-width. II. The feedback vertex set problem
- FPT algorithms for generalized feedback vertex set problems
- Linear time parameterized algorithms for subset feedback vertex set
- An improved parameterized algorithm for the independent feedback vertex set problem
- Feedback vertex set in mixed graphs
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem
- Parameterized and Exact Computation
- An FPT algorithm for the vertex cover \(P_4\) problem
- Confronting intractability via parameters
- Hitting long directed cycles is fixed-parameter tractable
- An improved exact algorithm for undirected feedback vertex set
- On compiling structured CNFs to OBDDs
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
- An Improved Exact Algorithm for Undirected Feedback Vertex Set
- Kernels for deletion to classes of acyclic digraphs
- Parameterized approximation algorithms for weighted vertex cover
- Space-efficient graph kernelizations
- Hardness of subgraph and supergraph problems in c-tournaments
- Fixed parameterized algorithms for generalized feedback vertex set problems
- Conflict free feedback vertex set: a parameterized dichotomy
- Parameterized and Exact Computation
- Odd cycle transversal in mixed graphs
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Minimum Cell Connection in Line Segment Arrangements
- Minimum Weighted Feedback Vertex Set on Diamonds
- On the complexity of singly connected vertex deletion
- Improved FPT Algorithms for Deletion to Forest-Like Structures
- On feedback vertex set: new measure and new structures
- Improved Algorithms for the Feedback Vertex Set Problems
- scientific article; zbMATH DE number 7278081 (Why is no real title available?)
- A polynomial kernel for block graph deletion
- Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
- A multivariate approach for weighted FPT algorithms
- Faster deterministic \textsc{Feedback Vertex Set}
- Two Hardness Results on Feedback Vertex Sets
- Fixed-parameter tractability results for feedback set problems in tournaments
- Iterative compression and exact algorithms
- A multivariate framework for weighted FPT algorithms
- Parameterized approximation algorithms for weighted vertex cover
- A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width
This page was built for publication: Improved algorithms for feedback vertex set problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q955350)
