Some combinatorial algorithms on the eliminating edge feedback number of hypergraphs

DOI10.1007/978-981-95-4839-2_17MaRDI QIDQ7290080zbMATH OpenFDO

Authors Zhongzheng Tang, Haoyang Zou, Zhuo Diao

Publication date 6 July 2026

Full work available at URL https://doi.org/10.1007/978-981-95-4839-2_17

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
• A lower bound on the order of the largest induced forest in planar graphs with high girth
• A new formula for the decycling number of regular graphs
• Approximating minimum feedback sets and multi-cuts in directed graphs (extended summary)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Large induced forests in graphs
• Large induced forests in sparse graphs
• Maximum induced forests of product graphs
• Minimum size of feedback vertex sets of planar graphs of girth at least five
• On Independent Circuits Contained in a Graph
• Packing directed circuits
• Size of the largest induced forest in subcubic graphs of girth at least four and five
• The size of graphs with given feedback vertex number

This page was built for publication: Some combinatorial algorithms on the eliminating edge feedback number of hypergraphs

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