The following pages link to (Q4779170):
Displaying 7 items.
- New spectral lower bounds on the bisection width of graphs (Q596083) (← links)
- Upper bounds on the bisection width of 3- and 4-regular graphs (Q849636) (← links)
- Pathwidth of cubic graphs and exact algorithms (Q1045933) (← links)
- Bounds on the max and min bisection of random cubic and random 4-regular graphs (Q1885048) (← links)
- Bounds on the bisection width for random \(d\)-regular graphs (Q2381523) (← links)
- Computation of best possible low degree expanders (Q2462391) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
