Pages that link to "Item:Q2719241"
From MaRDI portal
The following pages link to An alternative method to crossing minimization on hierarchical graphs (Q2719241):
Displaying 14 items.
- Two-layer planarization parameterized by feedback edge set (Q391093) (← links)
- 2-layer right angle crossing drawings (Q476445) (← links)
- Crossing minimization in extended level drawings of graphs (Q968125) (← links)
- Crossing minimization in weighted bipartite graphs (Q1044030) (← links)
- A tabu thresholding algorithm for arc crossing minimization in bipartite graphs (Q1919842) (← links)
- Efficient generation of different topological representations of graphs beyond-planarity (Q2206855) (← links)
- Global \(k\)-level crossing reduction (Q2865048) (← links)
- Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity (Q5141643) (← links)
- An SDP approach to multi-level crossing minimization (Q5406272) (← links)
- Crossing Minimization in Weighted Bipartite Graphs (Q5432313) (← links)
- Crossing numbers of beyond-planar graphs (Q5918404) (← links)
- Crossing numbers of beyond-planar graphs (Q5918988) (← links)
- Fixed-parameter algorithms for computing RAC drawings of graphs (Q6618251) (← links)
- Fixed-parameter algorithms for computing bend-restricted RAC drawings of graphs (Q6636993) (← links)