Pages that link to "Item:Q849636"
From MaRDI portal
The following pages link to Upper bounds on the bisection width of 3- and 4-regular graphs (Q849636):
Displaying 14 items.
- Properties of regular graphs with large girth via local algorithms (Q326821) (← links)
- New spectral lower bounds on the bisection width of graphs (Q596083) (← links)
- A faster polynomial-space algorithm for Max 2-CSP (Q899585) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Bounds on the max and min bisection of random cubic and random 4-regular graphs (Q1885048) (← links)
- Note on the bisection width of cubic graphs (Q2197453) (← links)
- An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs (Q2258080) (← links)
- Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689) (← links)
- Minimal selectors and fault tolerant networks (Q3057156) (← links)
- Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (Q3448816) (← links)
- Organisational hierarchy constructions with easy Kuramoto synchronisation (Q5061360) (← links)
- Minimum Power Dominating Sets of Random Cubic Graphs (Q5272639) (← links)
- On the minimum bisection of random 3-regular graphs (Q6106297) (← links)
- A bisection approach to subcubic maximum induced matching (Q6575400) (← links)
