Faster FPT algorithms for deletion to pairs of graph classes

DOI10.1007/978-3-030-86593-1_22OpenAlexW3200476441MaRDI QIDQ2140510

Venkatesh Raman, Diptapriyo Majumdar, Ashwin Jacob

Publication date: 20 May 2022

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes ⋮ Deletion to scattered graph classes. I: Case of finite number of graph classes

Cites Work

• Unnamed Item
• The node-deletion problem for hereditary properties is NP-complete
• Fixed-parameter tractability of graph modification problems for hereditary properties
• Representation of a finite graph by a set of intervals on the real line
• Interval Deletion Is Fixed-Parameter Tractable
• Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
• A Near-Optimal Planarization Algorithm

This page was built for publication: Faster FPT algorithms for deletion to pairs of graph classes