Pages that link to "Item:Q1770400"
From MaRDI portal
The following pages link to On the one-sided crossing minimization in a bipartite graph with large degrees (Q1770400):
Displaying 9 items.
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (Q494803) (← links)
- Crossing minimization in weighted bipartite graphs (Q1044030) (← links)
- The slotted online one-sided crossing minimization problem on 2-regular graphs (Q2169959) (← links)
- An improved bound on the one-sided minimum crossing number in two-layered drawings (Q2484013) (← links)
- A variable depth neighborhood search algorithm for the min-max arc crossing problem (Q2669507) (← links)
- Breaking cycles for minimizing crossings (Q5269367) (← links)
- Crossing Minimization in Weighted Bipartite Graphs (Q5432313) (← links)
- Graph Drawing (Q5896909) (← links)
- 2-Layer Graph Drawings with Bounded Pathwidth (Q6181954) (← links)