Pages that link to "Item:Q5048950"
From MaRDI portal
The following pages link to A better upper bound on the bisection width of de Bruijn networks (Q5048950):
Displaying 8 items.
- Some VLSI decompositions of the de Bruijn graph (Q1199602) (← links)
- On the bisection width and expansion of butterfly networks (Q1348690) (← links)
- A new upper bound for the isoperimetric number of de Bruijn networks (Q1375854) (← links)
- Bisecting de Bruijn and Kautz graphs (Q1392548) (← links)
- On the bisection width of the transposition network (Q4345575) (← links)
- Cutwidth of the de Bruijn graph (Q4359288) (← links)
- On the design of efficient ATM routing schemes (Q5958312) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
