Crossing Numbers and Cutwidths
From MaRDI portal
Recommendations
Cited in
(18)- Exact wirelength of hypercubes on a grid
- Crossing number, pair-crossing number, and expansion
- A branch-and-bound algorithm for the minimum cut linear arrangement problem
- A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
- Crossing number additivity over edge cuts
- Efficient computation of the Kauffman bracket
- Optimal embedding of locally twisted cubes into grids
- scientific article; zbMATH DE number 2084269 (Why is no real title available?)
- Embeddings of circulant networks
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- Planar crossing numbers of graphs of bounded genus
- Orthogonal tree decompositions of graphs
- The effect of planarization on width
- Crossing patterns of segments
- Subsequences with generalised gap constraints: upper and lower complexity bounds
- Rectilinear crossing number of graphs excluding a single-crossing graph as a minor
- Pair crossing number, cutwidth, and good drawings on arbitrary point sets
- The PACE 2024 parameterized algorithms and computational experiments challenge: one-sided crossing minimization
This page was built for publication: Crossing Numbers and Cutwidths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4679068)
