The following pages link to Cutwidth of the de Bruijn graph (Q4359288):
Displaying 10 items.
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- Bounds on mincut for Cayley graphs over Abelian groups (Q733724) (← links)
- Minimal cutwidth linear arrangements of abelian Cayley graphs (Q942098) (← links)
- Graph parameters measuring neighbourhoods in graphs-bounds and applications (Q944739) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- Wide diameters of de Bruijn graphs (Q2471070) (← links)
- Cutwidth of the \(r\)-dimensional mesh of \(d\)-ary trees (Q2729628) (← links)
- On bandwidth, cutwidth, and quotient graphs (Q4359287) (← links)
- A better upper bound on the bisection width of de Bruijn networks (Q5048950) (← links)
- Strong SDP based bounds on the cutwidth of a graph (Q6065655) (← links)
