Kernels for Feedback Arc Set In Tournaments

DOI10.4230/LIPIcs.FSTTCS.2009.2305zbMath1248.68235OpenAlexW2269174106MaRDI QIDQ2920111

Christophe Paul, Saket Saurabh, Serge Gaspers, Fedor V. Fomin, Stéphane Bessy, Anthony Perez, Steéphan Thomassé

Publication date: 24 October 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_f112.html

zbMATH Keywords

tournamentskernelsparameterized complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ Cluster Editing: Kernelization Based on Edge Cuts ⋮ Kernelization: New Upper and Lower Bound Techniques ⋮ Unnamed Item

This page was built for publication: Kernels for Feedback Arc Set In Tournaments