Pages that link to "Item:Q2946071"
From MaRDI portal
The following pages link to Deterministic Algorithms for the Independent Feedback Vertex Set Problem (Q2946071):
Displaying 12 items.
- A feedback vertex set of 2-degenerate graphs (Q300250) (← links)
- On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three (Q1123898) (← links)
- Independent feedback vertex sets for graphs of bounded diameter (Q1685021) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- Minimum feedback vertex set and acyclic coloring. (Q1853123) (← links)
- Feedback vertex set on planar graphs (Q1936089) (← links)
- An improved parameterized algorithm for the independent feedback vertex set problem (Q2447761) (← links)
- Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set (Q4634385) (← links)
- Recognizing Graphs Close to Bipartite Graphs (Q5111287) (← links)
- Independent Feedback Vertex Set for P_5-free Graphs (Q5136232) (← links)
- An improved FPT algorithm for independent feedback vertex set (Q5918287) (← links)
- Approximability of the independent feedback vertex set problem for bipartite graphs (Q5919046) (← links)