Pages that link to "Item:Q3557525"
From MaRDI portal
The following pages link to Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections (Q3557525):
Displaying 15 items.
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802) (← links)
- Cooperation in partly observable networked markets (Q1691363) (← links)
- On the instability of matching queues (Q1704139) (← links)
- The matching process and independent process in random regular graphs and hypergraphs (Q2111785) (← links)
- The jamming constant of uniform random graphs (Q2359716) (← links)
- On the unified dispersion problem: efficient formulations and exact algorithms (Q2629707) (← links)
- Markovian online matching algorithms on large bipartite random graphs (Q2684964) (← links)
- A greedy algorithm for finding a large 2‐matching on a random cubic graph (Q4581276) (← links)
- Independent dominating sets in graphs of girth five (Q4993127) (← links)
- On the probe complexity of local computation algorithms (Q5002725) (← links)
- Factor of IID Percolation on Trees (Q5298168) (← links)
- Experimental and Efficient Algorithms (Q5710051) (← links)
- Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth (Q6074650) (← links)
- Borel fractional colorings of Schreier graphs (Q6159728) (← links)
- Greedy maximal independent sets via local limits (Q6541390) (← links)
