Pages that link to "Item:Q1715061"
From MaRDI portal
The following pages link to Local algorithms, regular graphs of large girth, and random regular graphs (Q1715061):
Displaying 19 items.
- Properties of regular graphs with large girth via local algorithms (Q326821) (← links)
- Minimum 2-dominating sets in regular graphs (Q2091810) (← links)
- The matching process and independent process in random regular graphs and hypergraphs (Q2111785) (← links)
- Total domination in regular graphs (Q2132388) (← links)
- Entropy inequalities for factors of IID (Q2319838) (← links)
- Large cuts with local algorithms on triangle-free graphs (Q2411507) (← links)
- On the local density problem for graphs of given odd-girth (Q2413148) (← links)
- Suboptimality of local algorithms for a class of max-cut problems (Q2421823) (← links)
- Asymptotic bounds on total domination in regular graphs (Q2659200) (← links)
- Improved replica bounds for the independence ratio of random regular graphs (Q2687694) (← links)
- Ramanujan graphings and correlation decay in local algorithms (Q3452726) (← links)
- Correlation Bounds for Distant Parts of Factor of IID Processes (Q4601049) (← links)
- Fractional Chromatic Number, Maximum Degree, and Girth (Q5013575) (← links)
- Mutual information decay for factors of i.i.d. (Q5235118) (← links)
- Limits of local algorithms over sparse random graphs (Q5892454) (← links)
- A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems (Q6068539) (← links)
- A randomized construction of high girth regular graphs (Q6073632) (← links)
- Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth (Q6074650) (← links)
- Greedy maximal independent sets via local limits (Q6541390) (← links)
