Pages that link to "Item:Q657916"

The following pages link to Kernels for feedback arc set in tournaments (Q657916):

Displaying 23 items.

• Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
• Kernel and fast algorithm for dense triplet inconsistency (Q391097) (← links)
• The solution space of sorting with recurring comparison faults (Q726101) (← links)
• Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique (Q896028) (← links)
• Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
• Cluster editing: kernelization based on edge cuts (Q1759680) (← links)
• On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
• A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
• A quadratic vertex kernel for feedback arc set in bipartite tournaments (Q2258074) (← links)
• Kernels for packing and covering problems (Q2272393) (← links)
• On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments (Q2345613) (← links)
• The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders (Q2392744) (← links)
• Decomposability index of tournaments (Q2404390) (← links)
• Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
• The Solution Space of Sorting with Recurring Comparison Faults (Q2819522) (← links)
• COMPARING AND AGGREGATING PARTIAL ORDERS WITH KENDALL TAU DISTANCES (Q2846476) (← links)
• Tournaments and Semicomplete Digraphs (Q3120434) (← links)
• Locally Semicomplete Digraphs and Generalizations (Q3120438) (← links)
• Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes (Q3449838) (← links)
• Packing Arc-Disjoint Cycles in Tournaments (Q5092386) (← links)
• (Q5092387) (← links)
• Efficient algorithms for measuring the funnel-likeness of DAGs (Q5915704) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)