Pages that link to "Item:Q5632594"
From MaRDI portal
The following pages link to A SPECIAL CROSSING NUMBER FOR BIPARTITE GRAPHS: A RESEARCH PROBLEM (Q5632594):
Displaying 5 items.
- A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
- A tabu search algorithm for the bipartite drawing problem (Q1609918) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- Genetic algorithms for drawing bipartite graphs (Q4844579) (← links)
- On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem (Q5096926) (← links)
