The bisection problem for graphs of degree 4. (Configuring transputer systems)
From MaRDI portal
Recommendations
- Upper bounds on the bisection width of 3- and 4-regular graphs
- Upper bounds on the bisection width of 3- and 4-regular graphs
- An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs
- On the graph bisection problem
- Bounds on the max and min bisection of random cubic and random 4-regular graphs
Cited in
(7)- Bisecting de Bruijn and Kautz graphs
- Short disjoint cycles in graphs with degree constraints
- An \(\mathcal{O}(n^4)\) time algorithm to compute the bisection width of solid grid graphs
- Edge-bisection of chordal rings
- A better upper bound on the bisection width of de Bruijn networks (extended abstract)
- Communication throughput of interconnection networks
- Short disjoint cycles in graphs with degree constraints
This page was built for publication: The bisection problem for graphs of degree 4. (Configuring transputer systems)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035242)