Parameterized Complexity of Fair Feedback Vertex Set Problem

DOI10.1007/978-3-030-50026-9_18MaRDI QIDQ5042245zbMATH OpenOpenAlexFDO

Authors Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh

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

parameterized complexityFPTfeedback vertex setW[1-hard]

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 1033414 (Why is no real title available?)
• scientific article; zbMATH DE number 1478494 (Why is no real title available?)
• Algorithmic meta-theorems for restrictions of treewidth
• Deconstructing parameterized hardness of Fair Vertex Deletion problems
• Detecting Feedback Vertex Sets of Size k in O*(2.7^k) Time
• Fair edge deletion problems
• Fixed-Parameter Tractability and Completeness I: Basic Results
• Improved analysis of highest-degree branching for feedback vertex set
• Nonserial dynamic programming
• ON DISJOINT CYCLES
• On feedback vertex set: new measure and new structures
• Parameterized complexity of fair vertex evaluation problems
• Reducibility among combinatorial problems

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

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