Improved Algorithms and Bounds for Orthogonal Drawings.
Achilleas PapakostasIoannis G. TollisPublished in: Graph Drawing (1994)
Keyphrases
- worst case
- upper bound
- times faster
- learning algorithm
- data structure
- computational complexity
- average case
- upper and lower bounds
- perceptron algorithm
- data mining
- lower and upper bounds
- graph theory
- convergence rate
- data mining algorithms
- computationally efficient
- computational cost
- significant improvement
- decision trees