The following pages link to Crossing Numbers and Cutwidths (Q4679068):
Displayed 9 items.
- Embeddings of circulant networks (Q358657) (← links)
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength (Q411854) (← links)
- Planar crossing numbers of graphs of bounded genus (Q452001) (← links)
- Exact wirelength of hypercubes on a grid (Q1028121) (← links)
- A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510) (← links)
- A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout (Q2201764) (← links)
- Efficient computation of the Kauffman bracket (Q2878662) (← links)
- Optimal Embedding of Locally Twisted Cubes into Grids (Q2971629) (← links)
- Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)