Pages that link to "Item:Q5269367"
From MaRDI portal
The following pages link to Breaking cycles for minimizing crossings (Q5269367):
Displaying 7 items.
- A rearrangement of adjacency matrix based approach for solving the crossing minimization problem (Q411236) (← links)
- On the complexity of crossings in permutations (Q1011761) (← links)
- Crossing minimization in weighted bipartite graphs (Q1044030) (← links)
- k-Level Crossing Minimization Is NP-Hard for Trees (Q3078383) (← links)
- New Approximation to the One-sided Radial Crossing Minimization (Q3184609) (← links)
- An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
- Approximation algorithms for minimizing edge crossings in radial drawings (Q5961979) (← links)