The following pages link to (Q4350040):
Displaying 11 items.
- A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs (Q1266546) (← links)
- Edge crossings in drawings of bipartite graphs (Q1322570) (← links)
- ARC crossing minimization in hierarchical digraphs with tabu search (Q1373159) (← links)
- A tabu search algorithm for the bipartite drawing problem (Q1609918) (← links)
- Tabu search for the dynamic bipartite drawing problem (Q1652530) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- Tabu search for min-max edge crossing in graphs (Q2337395) (← links)
- (Q4207581) (← links)
- (Q4422291) (← links)
- Incremental bipartite drawing problem (Q5955967) (← links)