Pages that link to "Item:Q856420"
From MaRDI portal
The following pages link to Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420):
Displaying 15 items.
- (Q5136298) (← links)
- (Q5140722) (← links)
- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number (Q5387763) (← links)
- (Q5743380) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- (Q5874544) (← links)
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5895104) (← links)
- An improved FPT algorithm for independent feedback vertex set (Q5918287) (← links)
- Finding \(k\)-secluded trees faster (Q6039423) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures. (Q6065438) (← links)
- A parameterized algorithm for subset feedback vertex set in tournaments (Q6076355) (← links)
- Minimization and parameterized variants of vertex partition problems on graphs (Q6087212) (← links)
- Finding \(k\)-secluded trees faster (Q6133646) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures (Q6492092) (← links)