Pages that link to "Item:Q4597601"
From MaRDI portal
The following pages link to The Greedy Independent Set in a Random Graph with Given Degrees (Q4597601):
Displaying 9 items.
- Generalized random sequential adsorption on Erdős-Rényi random graphs (Q504210) (← links)
- Analysis of greedy algorithms on graphs with bounded degrees (Q1417582) (← links)
- Corrected mean-field model for random sequential adsorption on random geometric graphs (Q1756547) (← links)
- The matching process and independent process in random regular graphs and hypergraphs (Q2111785) (← links)
- The jamming constant of uniform random graphs (Q2359716) (← links)
- Markovian online matching algorithms on large bipartite random graphs (Q2684964) (← links)
- Surprising identities for the greedy independent set on Cayley trees (Q5049896) (← links)
- Large deviations for the greedy exploration process on configuration models (Q6177629) (← links)
- Greedy maximal independent sets via local limits (Q6541390) (← links)