Parameterized complexity of directed feedback set problems in tournaments.

DOI10.1007/B11837MaRDI QIDQ5900778zbMATH OpenFDO

Authors Venkatesh Raman, Saket Saurabh

Publication date 20 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/B11837

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Parameterized algorithms for feedback set problems and their duals in tournaments
• Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
• Fixed-parameter tractability results for feedback set problems in tournaments
• Fixed-parameter complexity of feedback vertex set in bipartite tournaments
• Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments

Cited in

(12)

• Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
• Component order connectivity in directed graphs
• Fixed-parameter tractability results for feedback set problems in tournaments
• Packing arc-disjoint cycles in tournaments
• Directed acyclic subgraph problem parameterized above the Poljak-Turzík bound
• Fixed-parameter complexity of feedback vertex set in bipartite tournaments
• Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
• Parameterized Eulerian strong component arc deletion problem on tournaments
• Packing Arc-Disjoint Cycles in Tournaments
• Hardness of subgraph and supergraph problems in c-tournaments
• Packing arc-disjoint cycles in bipartite tournaments
• Parameterized algorithms for feedback set problems and their duals in tournaments

This page was built for publication: Parameterized complexity of directed feedback set problems in tournaments.

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