Parameterized Complexity of Fair Feedback Vertex Set Problem

DOI10.1007/978-3-030-50026-9_18OpenAlexW4236632847MaRDI QIDQ5042245

Soumen Maity, Saket Saurabh, Lawqueen Kanesh, Komal Muluk

Publication date: 19 October 2022

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-50026-9_18

zbMATH Keywords

feedback vertex setparameterized complexityFPTW[1-hard]

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• On feedback vertex set: new measure and new structures
• Algorithmic meta-theorems for restrictions of treewidth
• Improved analysis of highest-degree branching for feedback vertex set
• Parameterized complexity of fair deletion problems
• Deconstructing parameterized hardness of Fair Vertex Deletion problems
• Nonserial dynamic programming
• ON DISJOINT CYCLES
• Fixed-Parameter Tractability and Completeness I: Basic Results
• Reducibility among Combinatorial Problems
• Detecting Feedback Vertex Sets of Size k in O*(2.7^k) Time
• Fair edge deletion problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parameterized Complexity of Fair Feedback Vertex Set Problem