An Algorithm to Construct Greedy Drawings of Triangulations.
Patrizio AngeliniFabrizio FratiLuca GrilliPublished in: Graph Drawing (2008)
Keyphrases
- dynamic programming
- learning algorithm
- search space
- detection algorithm
- k means
- improved algorithm
- computationally efficient
- simulated annealing
- probabilistic model
- experimental evaluation
- np hard
- neural network
- hill climbing
- globally optimal
- computational complexity
- greedy algorithms
- greedy algorithm
- worst case
- data sets
- similarity measure
- particle swarm optimization
- greedy strategy
- locally optimal
- matching algorithm
- theoretical analysis
- expectation maximization
- input data
- linear programming
- d objects
- cost function
- significant improvement
- preprocessing
- data streams
- search algorithm
- bayesian networks