Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods.
Carla BinucciWalter DidimoPublished in: WALCOM (2014)
Keyphrases
- exact methods
- exact algorithms
- heuristic methods
- line drawings
- integer programming
- np hard
- lower bound
- search methods
- planar graphs
- exact solution
- branch and bound algorithm
- optimal solution
- approximation algorithms
- search algorithm
- knapsack problem
- neural network
- branch and bound
- heuristic search
- multi objective
- computational complexity