A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution.
Michael A. BekosHenry FörsterChristian GeckelerLukas HolländerMichael KaufmannAmadäus M. SpallekJan SplettPublished in: CoRR (2018)
Keyphrases
- graph matching
- combinatorial optimization
- solution quality
- maximum independent set
- data sets
- engineering drawings
- minimum spanning tree
- bipartite graph
- tabu search
- multiresolution
- optimal solution
- simulated annealing
- graph theory
- genetic algorithm
- independent set
- case study
- series parallel
- greedy heuristic
- bayesian networks
- heuristic methods
- graph databases
- line drawings
- search algorithm
- search space
- search strategies
- high precision