Pages that link to "Item:Q1266546"
From MaRDI portal
The following pages link to A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs (Q1266546):
Displayed 8 items.
- A rearrangement of adjacency matrix based approach for solving the crossing minimization problem (Q411236) (← links)
- 2-layer right angle crossing drawings (Q476445) (← links)
- Crossing minimization in extended level drawings of graphs (Q968125) (← links)
- ARC crossing minimization in hierarchical digraphs with tabu search (Q1373159) (← links)
- A tabu search algorithm for the bipartite drawing problem (Q1609918) (← links)
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization (Q1811085) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- Incremental bipartite drawing problem (Q5955967) (← links)