Simultaneous feedback edge set: a parameterized perspective

DOI10.1007/s00453-020-00773-9OpenAlexW3092396734MaRDI QIDQ2659779

Saket Saurabh, Fahad Panolan, Akanksha Agrawal, Meirav Zehavi

Publication date: 26 March 2021

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6776/

zbMATH Keywords

parameterized complexityfeedback edge set\(\alpha\)-matroid parity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Related Items (1)

Feedback edge sets in temporal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A parameterized view on matroid optimization problems
• Matroid matching and some applications
• Some simplified NP-complete graph problems
• Which problems have strongly exponential complexity?
• Faster deterministic \textsc{Feedback Vertex Set}
• Dual Connectedness of Edge-Bicolored Graphs and Beyond
• Deterministic Truncation of Linear Matroids
• Kernelization
• A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
• Simultaneous Feedback Vertex Set
• Exact Algorithms via Monotone Local Search
• Multiplying matrices faster than coppersmith-winograd
• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
• Parameterized Algorithms

This page was built for publication: Simultaneous feedback edge set: a parameterized perspective