Nonpartisan feedback vertex set

DOI10.1007/978-3-031-92935-9_14MaRDI QIDQ6902107zbMATH OpenFDO

Authors Nidhi Purohit, Souvik Saha, Saket Saurabh, Anannya Upasana

Publication date 11 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-92935-9_14

zbMATH Keywords

fairnessfeedback vertex setFPTkernel

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
• A 4k^2 kernel for feedback vertex set
• Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
• Connected feedback vertex set in planar graphs
• Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
• FPT algorithms for connected feedback vertex set
• On colorful vertex and edge cover problems
• On parameterized independent feedback vertex set
• Parameterized approximation scheme for feedback vertex set
• Parameterized complexity of fair feedback vertex set problem
• Reducibility among combinatorial problems
• Tropical matchings in vertex-colored graphs

This page was built for publication: Nonpartisan feedback vertex set

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