The following pages link to Graph Drawing (Q5896909):
Displaying 4 items.
- On the one-sided crossing minimization in a bipartite graph with large degrees (Q1770400) (← links)
- An improved bound on the one-sided minimum crossing number in two-layered drawings (Q2484013) (← links)
- Simple and Efficient Bilayer Cross Counting (Q3378492) (← links)
- Breaking cycles for minimizing crossings (Q5269367) (← links)