Fair edge deletion problems

DOI10.1109/12.24280MaRDI QIDQ5375472zbMATH OpenOpenAlexFDO

Authors L. Lin, Sartaj Sahni

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(9)

• Approximations for the maximum acyclic subgraph problem
• Local linear set on graphs with bounded twin cover number
• Parameterized complexity of fair feedback vertex set problem
• Parameterized Complexity of Fair Feedback Vertex Set Problem
• Parameterized complexity of fair vertex evaluation problems
• Extended MSO model checking via small vertex integrity
• Parameterized complexity of fair many-to-one matchings
• On sparse hitting sets: from fair vertex cover to highway dimension
• Fixed-parameter algorithms for fair hitting set problems

This page was built for publication: Fair edge deletion problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375472)