Fixed-Parameter Complexity of Feedback Vertex Set in Bipartite Tournaments
From MaRDI portal
Publication:3104629
DOI10.1007/978-3-642-25591-5_36zbMath1350.68147OpenAlexW77373059MaRDI QIDQ3104629
Publication date: 16 December 2011
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25591-5_36
Analysis of algorithms and problem complexity (68Q25) Directed graphs (digraphs), tournaments (05C20)
Related Items (3)
Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments ⋮ A parameterized algorithm for subset feedback vertex set in tournaments ⋮ A quadratic vertex kernel for feedback arc set in bipartite tournaments
This page was built for publication: Fixed-Parameter Complexity of Feedback Vertex Set in Bipartite Tournaments
