Pages that link to "Item:Q4634385"
From MaRDI portal
The following pages link to Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set (Q4634385):
Displaying 21 items.
- On parameterized independent feedback vertex set (Q690464) (← links)
- On the number of connected sets in bounded degree graphs (Q1627210) (← links)
- Independent feedback vertex sets for graphs of bounded diameter (Q1685021) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- On the feedback number of 3-uniform linear extremal hypergraphs (Q2150590) (← links)
- On some hard and some tractable cases of the maximum acyclic matching problem (Q2288858) (← links)
- An improved parameterized algorithm for the independent feedback vertex set problem (Q2447761) (← links)
- An Improved Exact Algorithm for Undirected Feedback Vertex Set (Q2867116) (← links)
- Deterministic Algorithms for the Independent Feedback Vertex Set Problem (Q2946071) (← links)
- Improved Algorithms for the Feedback Vertex Set Problems (Q3603546) (← links)
- (Q5005155) (← links)
- (Q5005166) (← 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)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures. (Q6065438) (← links)
- Optimal schemes for combinatorial query problems with integer feedback (Q6138906) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures (Q6492092) (← links)
- Sparsity in covering solutions (Q6547950) (← links)
- Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets (Q6606167) (← links)
