Pages that link to "Item:Q2663705"
From MaRDI portal
The following pages link to Towards a polynomial kernel for directed feedback vertex set (Q2663705):
Displaying 8 items.
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- On directed feedback vertex set parameterized by treewidth (Q1627154) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- A randomized polynomial kernel for subset feedback vertex set (Q1702849) (← links)
- Fine-grained parameterized complexity analysis of knot-free vertex deletion -- a deadlock resolution graph problem (Q1790957) (← links)
- Kernels for Deletion to Classes of Acyclic Digraphs. (Q4636487) (← links)
- Parameterized algorithms for generalizations of directed feedback vertex set (Q5925617) (← links)
- Slim tree-cut width (Q6586668) (← links)
