Pages that link to "Item:Q1417582"

The following pages link to Analysis of greedy algorithms on graphs with bounded degrees (Q1417582):

Displaying 22 items.

• Properties of regular graphs with large girth via local algorithms (Q326821) (← links)
• The cook-book approach to the differential equation method (Q465658) (← links)
• Average case analysis of greedy algorithms for optimisation problems on set systems (Q672472) (← links)
• Birth control for giants (Q949755) (← links)
• Worst case analysis of a greedy algorithm for graph thickness (Q1007554) (← links)
• Connected domination of regular graphs (Q1025488) (← links)
• Large independent sets in random regular graphs (Q1034530) (← links)
• Analysis of a greedy heuristic for finding small dominating sets in graphs (Q1183397) (← links)
• Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree (Q1799575) (← 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)
• (Q4252388) (← links)
• The Greedy Independent Set in a Random Graph with Given Degrees (Q4597601) (← 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)
• (Q5501284) (← links)
• Greedy maximal independent sets via local limits (Q6541390) (← links)