Pages that link to "Item:Q1935808"
From MaRDI portal
The following pages link to SDP-based algorithms for maximum independent set problems on hypergraphs (Q1935808):
Displaying 6 items.
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket (Q1704581) (← links)
- Approximating coloring and maximum independent sets in 3-uniform hypergraphs (Q2765960) (← links)
- (Q5184941) (← links)
- Automated category tree construction: hardness bounds and algorithms (Q6572611) (← links)