The following pages link to (Q4859012):
Displaying 6 items.
- Upper bounds on the bisection width of 3- and 4-regular graphs (Q849636) (← links)
- Vertex ordering and partitioning problems for random spatial graphs. (Q1884828) (← links)
- A new method, the fusion fission, for the relaxed \(k\)-way graph partitioning problem, and comparisons with some multilevel algorithms (Q2466393) (← links)
- Optimal Cheeger cuts and bisections of random geometric graphs (Q2657914) (← links)
- A better upper bound on the bisection width of de Bruijn networks (Q5048950) (← links)
- Communication throughput of interconnection networks (Q5096871) (← links)