scientific article; zbMATH DE number 4094839
From MaRDI portal
Publication:3821602
Recommendations
- On bipartite drawings and the linear arrangement problem
- Simple and efficient bilayer cross counting
- On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem
- Edge crossings in drawings of bipartite graphs
- New exact results and bounds for bipartite crossing numbers of meshes
Cited in
(9)- A new lower bound for the bipartite crossing number with applications
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization
- ON THE SATELLITE CROSSING NUMBER CONJECTURE
- The crossing number of the bipartite permutation graph
- Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
- On the Maximum Crossing Number
- On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem
- New exact results and bounds for bipartite crossing numbers of meshes
- On the Orchard crossing number of the complete bipartite graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3821602)