scientific article; zbMATH DE number 7650230

DOI10.4230/LIPIcs.IPEC.2019.22MaRDI QIDQ5875556

Yusuke Kobayashi, Yoichi Iwata

Publication date: 3 February 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

branch and boundfeedback vertex setmeasure and conquer

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (7)

Parameterized complexity of fair feedback vertex set problem ⋮ Fixed parameterized algorithms for generalized feedback vertex set problems ⋮ Improved FPT Algorithms for Deletion to Forest-Like Structures. ⋮ Minimization and parameterized variants of vertex partition problems on graphs ⋮ Approximability of the independent feedback vertex set problem for bipartite graphs ⋮ Improved analysis of highest-degree branching for feedback vertex set ⋮ FPT algorithms for generalized feedback vertex set problems

This page was built for publication: