A linear algorithm for compact box-drawings of trees.
Masud HasanMd. Saidur RahmanTakao NishizekiPublished in: Networks (2003)
Keyphrases
- learning algorithm
- times faster
- computational complexity
- detection algorithm
- worst case
- cost function
- experimental evaluation
- objective function
- significant improvement
- computationally efficient
- expectation maximization
- tree structure
- matching algorithm
- binary tree
- boolean expressions
- unordered trees
- improved algorithm
- linear complexity
- optimization algorithm
- theoretical analysis
- dynamic programming
- search space
- optimal solution
- similarity measure
- linear programming
- high accuracy
- closed form
- convergence rate
- reinforcement learning
- bayesian networks
- data sets