Publication:4636486

DOI10.4230/LIPIcs.ISAAC.2016.5zbMath1398.68204arXiv1611.07701MaRDI QIDQ4636486

Meirav Zehavi, Saket Saurabh, Fahad Panolan, Akanksha Agrawal

Publication date: 19 April 2018

Full work available at URL: https://arxiv.org/abs/1611.07701

zbMATH Keywords

parameterized complexity; feedback edge set; \(\alpha\)-matroid parity

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)