Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
From MaRDI portal
Publication:329279
DOI10.1007/s00453-015-0038-2zbMath1350.68126MaRDI QIDQ329279
Saket Saurabh, Alessandro Maddaloni, Jörgen Bang-Jensen
Publication date: 21 October 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-015-0038-2
kernels; feedback vertex set; parameterized complexity; locally semicomplete digraph; feedback arc set; quasi-transitive digraph; bounded independence number; decomposable digraph
68Q25: Analysis of algorithms and problem complexity
05C85: Graph algorithms (graph-theoretic aspects)
05C20: Directed graphs (digraphs), tournaments