Pages that link to "Item:Q3434567"
From MaRDI portal
The following pages link to Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments (Q3434567):
Displaying 13 items.
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← links)
- Feedback arc set in bipartite tournaments is NP-complete (Q845963) (← links)
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) (← links)
- Parameterized algorithms for \(d\)-hitting set: the weighted case (Q964386) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Chordal deletion is fixed-parameter tractable (Q973007) (← links)
- Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- Improved FPT algorithm for feedback vertex set problem in bipartite tournament (Q2380045) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
