Fair edge deletion problems
From MaRDI portal
Publication:5375472
DOI10.1109/12.24280zbMath1395.68213OpenAlexW2120400308MaRDI QIDQ5375472
Publication date: 14 September 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.24280
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (7)
Approximations for the maximum acyclic subgraph problem ⋮ Parameterized Complexity of Fair Feedback Vertex Set Problem ⋮ Parameterized complexity of fair feedback vertex set problem ⋮ Parameterized complexity of fair deletion problems ⋮ Extended MSO model checking via small vertex integrity ⋮ Unnamed Item ⋮ Local linear set on graphs with bounded twin cover number
This page was built for publication: Fair edge deletion problems
