Pages that link to "Item:Q6074650"
From MaRDI portal
The following pages link to Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth (Q6074650):
Displaying 7 items.
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802) (← links)
- The matching process and independent process in random regular graphs and hypergraphs (Q2111785) (← links)
- A note on the random greedy independent set algorithm (Q2830236) (← links)
- Random iteration algorithm for graph-directed sets (Q2917349) (← links)
- (Q3479822) (← links)
- Experimental and Efficient Algorithms (Q5710051) (← links)
- Greedy maximal independent sets via local limits (Q6541390) (← links)