On the feedback number of 3-uniform linear extremal hypergraphs
From MaRDI portal
Publication:2150590
DOI10.1007/978-3-030-92681-6_54OpenAlexW4206132064MaRDI QIDQ2150590
Zhongzheng Tang, Zhuo Diao, Yu Cong Tang
Publication date: 29 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_54
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Cites Work
- Covering triangles in edge-weighted graphs
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- A short proof of a theorem of Reid and Parker on tournaments
- Packing directed circuits
- Approximating minimum feedback vertex sets in hypergraphs
- Faster deterministic \textsc{Feedback Vertex Set}
- Erdős-Pósa property of chordless cycles and its applications
- An improved exact algorithm for undirected feedback vertex set
- Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles
- Graph Theory
- A fixed-parameter algorithm for the directed feedback vertex set problem
- Feedback vertex sets and cyclically reducible graphs
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Approximating minimum feedback sets and multi-cuts in directed graphs
- Losing Treewidth by Separating Subsets
- On Independent Circuits Contained in a Graph
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Disproof of a conjecture of Erdös and moser on tournaments
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
