On Improving Orthogonal Drawings: The 4M-Algorithm.
Ulrich FößmeierCarsten HeßMichael KaufmannPublished in: Graph Drawing (1998)
Keyphrases
- computational complexity
- detection algorithm
- high accuracy
- learning algorithm
- np hard
- dynamic programming
- times faster
- improved algorithm
- significant improvement
- cost function
- single pass
- estimation algorithm
- selection algorithm
- recognition algorithm
- optimization algorithm
- simulated annealing
- worst case
- computational cost
- experimental evaluation
- objective function
- input data
- computationally efficient
- d objects
- experimental study
- k means
- search space
- preprocessing
- genetic algorithm