Differential Methods for Finding Independent Sets in Hypergraphs

DOI10.1137/S0895480104442571zbMath1112.05071OpenAlexW2006906295MaRDI QIDQ5470819

Yusheng Li, Wenan Zang

Publication date: 1 June 2006

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480104442571

zbMATH Keywords

algorithmconvex function

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Independence in uniform linear triangle-free hypergraphs ⋮ On vertex independence number of uniform hypergraphs

This page was built for publication: Differential Methods for Finding Independent Sets in Hypergraphs