On feedback vertex set in reducible flow hypergraphs

DOI10.1016/J.PROCS.2021.11.027MaRDI QIDQ6890902zbMATH OpenFDO

Authors Luerbio Faria, André L. P. Guedes, Lilian Markenzon

Publication date 2 December 2025

Published in Procedia Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.PROCS.2021.11.027

zbMATH Keywords

approximation algorithmsdirected hypergraphsfeedback vertex setNP-completeness

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: On feedback vertex set in reducible flow hypergraphs

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