Feedback vertex sets in tournaments

DOI10.1007/978-3-642-15775-2_23MaRDI QIDQ3586468zbMATH OpenOpenAlexFDO

Authors Serge Gaspers, Matthias Mnich

Publication date 6 September 2010

Published in Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15775-2_23

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Feedback vertex sets in tournaments
• Improved bounds for minimal feedback vertex sets in tournaments
• Improved Bounds for Minimal Feedback Vertex Sets in Tournaments
• An approximation algorithm for feedback vertex sets in tournaments
• Faster exact and parameterized algorithm for feedback vertex set in tournaments

Cited in

(14)

• On enumerating all minimal solutions of feedback problems
• Tournaments as feedback arc sets
• Subset feedback vertex sets in chordal graphs
• An approximation algorithm for feedback vertex sets in tournaments
• Minimal dominating sets in graph classes: combinatorial bounds and enumeration
• A Min-Max Theorem on Tournaments
• Improved bounds for minimal feedback vertex sets in tournaments
• Faster exact and parameterized algorithm for feedback vertex set in tournaments
• A 7/3-approximation for feedback vertex sets in tournaments
• Improved Bounds for Minimal Feedback Vertex Sets in Tournaments
• Feedback vertex sets in tournaments
• When to Release Feedback in a Dynamic Tournament
• Minimal stable sets in tournaments
• Dynamic parameterized feedback problems in tournaments

This page was built for publication: Feedback vertex sets in tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586468)