Simultaneous feedback edge set: a parameterized perspective
From MaRDI portal
Publication:2659779
Recommendations
Cites work
- A 4k^2 kernel for feedback vertex set
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- A parameterized view on matroid optimization problems
- Dual connectedness of edge-bicolored graphs and beyond
- Faster deterministic \textsc{Feedback Vertex Set}
- Graph theory
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1305522 (Why is no real title available?)
- scientific article; zbMATH DE number 5047784 (Why is no real title available?)
- Kernelization. Theory of parameterized preprocessing
- Matroid matching and some applications
- Multiplying matrices faster than coppersmith-winograd
- Parameterized algorithms
- Simultaneous feedback vertex set: a parameterized perspective
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Some simplified NP-complete graph problems
- Which problems have strongly exponential complexity?
Cited in
(9)- A faster parameterized algorithm for Group Feedback Edge Set
- Simultaneous feedback vertex set: a parameterized perspective
- Simultaneous feedback edge set: a parameterized perspective
- Simultaneous feedback vertex set: a parameterized perspective
- Feedback edge sets in temporal graphs
- Parameterized complexity classification for interval constraints
- Can you link up with treewidth?
- Multicut problems in embedded graphs: the dependency of complexity on the demand pattern
- Can you link up with treewidth?
This page was built for publication: Simultaneous feedback edge set: a parameterized perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2659779)
