Pages that link to "Item:Q5710051"
From MaRDI portal
The following pages link to Experimental and Efficient Algorithms (Q5710051):
Displaying 11 items.
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- Large independent sets in general random intersection graphs (Q952443) (← links)
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802) (← links)
- Analysis of greedy algorithms on graphs with bounded degrees (Q1417582) (← links)
- Constructions of independent sets in random intersection graphs (Q2637343) (← links)
- Large 2-independent sets of regular graphs (Q2843924) (← links)
- (Q3751618) (← links)
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set (Q4319768) (← links)
- The Greedy Independent Set in a Random Graph with Given Degrees (Q4597601) (← links)
- Automata, Languages and Programming (Q5466535) (← links)
- The MaxIS-Shapley value in perfect graphs (Q6606181) (← links)