Pages that link to "Item:Q5704082"

The following pages link to A Min-Max Theorem on Feedback Vertex Sets (Q5704082):

Displaying 17 items.

• A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
• Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
• Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
• Linear programming based approximation algorithms for feedback set problems in bipartite tournaments (Q534571) (← links)
• Packing directed circuits exactly (Q663091) (← links)
• Feedback arc set in bipartite tournaments is NP-complete (Q845963) (← links)
• Improved approximation algorithm for the feedback set problem in a bipartite tournament (Q957363) (← links)
• On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
• Packing cycles in graphs. II (Q1405116) (← links)
• Analysis, calculation and utilization of the \(k\)-balance attribute in interdependent networks (Q1990190) (← links)
• A quadratic vertex kernel for feedback arc set in bipartite tournaments (Q2258074) (← links)
• Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
• Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
• Improved FPT algorithm for feedback vertex set problem in bipartite tournament (Q2380045) (← links)
• Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
• Triangle packing in (sparse) tournaments: approximation and kernelization (Q5111699) (← links)
• (Q5743513) (← links)