Pages that link to "Item:Q1417582"
From MaRDI portal
The following pages link to Analysis of greedy algorithms on graphs with bounded degrees (Q1417582):
Displayed 14 items.
- Properties of regular graphs with large girth via local algorithms (Q326821) (← links)
- The cook-book approach to the differential equation method (Q465658) (← links)
- Birth control for giants (Q949755) (← links)
- Connected domination of regular graphs (Q1025488) (← links)
- Large independent sets in random regular graphs (Q1034530) (← links)
- Bounds on the max and min bisection of random cubic and random 4-regular graphs (Q1885048) (← links)
- Minimum 2-dominating sets in regular graphs (Q2091810) (← links)
- The jamming constant of uniform random graphs (Q2359716) (← links)
- Bounds on the bisection width for random \(d\)-regular graphs (Q2381523) (← links)
- A gentle introduction to the differential equation method and dynamic concentration (Q2675831) (← links)
- THE DEPRIORITISED APPROACH TO PRIORITISED ALGORITHMS (Q3633341) (← links)
- Decycling numbers of random regular graphs (Q4798175) (← links)
- Minimum Power Dominating Sets of Random Cubic Graphs (Q5272639) (← links)
- Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm (Q5458503) (← links)