A Linear Kernel for Planar Feedback Vertex Set
From MaRDI portal
Recommendations
- A new linear kernel for undirected planar feedback vertex set: smaller and simpler
- A 13k-kernel for planar feedback vertex set via region decomposition
- An improved kernel for the undirected planar feedback vertex set problem
- A 14k-kernel for planar feedback vertex set via region decomposition
- A Cubic Kernel for Feedback Vertex Set
Cites work
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- A Cubic Kernel for Feedback Vertex Set
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
- Algorithms – ESA 2005
- Bidimensionality: new connections between FPT algorithms and PTASs
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Computing and Combinatorics
- Dynamic Programming and Fast Matrix Multiplication
- Exact Computation of Maximum Induced Forest
- Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$
- scientific article; zbMATH DE number 1003266 (Why is no real title available?)
- scientific article; zbMATH DE number 6118220 (Why is no real title available?)
- scientific article; zbMATH DE number 5158513 (Why is no real title available?)
- scientific article; zbMATH DE number 5485529 (Why is no real title available?)
- scientific article; zbMATH DE number 125608 (Why is no real title available?)
- scientific article; zbMATH DE number 139781 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1953101 (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?)
- scientific article; zbMATH DE number 1368469 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Improved Algorithms for the Feedback Vertex Set Problems
- New upper bounds on the decomposability of planar graphs
- ON DISJOINT CYCLES
- On the feedback vertex set problem for a planar graph
- Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
- Parameterized and Exact Computation
- Parametrized complexity theory.
- Polynomial-time data reduction for dominating set
- Quasi-planar graphs have a linear number of edges
- The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
Cited in
(20)- Connecting face hitting sets in planar graphs
- Towards optimal kernel for connected vertex cover in planar graphs
- Safe approximation and its relation to kernelization
- A 14k-kernel for planar feedback vertex set via region decomposition
- A 13k-kernel for planar feedback vertex set via region decomposition
- Bidimensionality and kernels
- A Cubic Kernel for Feedback Vertex Set
- Linear Kernel for Planar Connected Dominating Set
- Kernelization: new upper and lower bound techniques
- An improved kernel for the undirected planar feedback vertex set problem
- A Retrospective on (Meta) Kernelization
- Linear-time kernelization for feedback vertex set
- A linear kernel for planar red-blue dominating set
- A new linear kernel for undirected planar feedback vertex set: smaller and simpler
- A linear kernel for a planar connected dominating set
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms
- On the small cycle transversal of planar graphs
- Deep kernelization for the tree bisection and reconnection (TBR) distance in phylogenetics
- Kernel bounds for disjoint cycles and disjoint paths
- A cubic kernel for feedback vertex set and loop cutset
This page was built for publication: A Linear Kernel for Planar Feedback Vertex Set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503587)
