A Linear Algorithm for Computing Independence Polynomials of Trees.
Ohr KadrawiVadim E. LevitRon YosefMatan MizrachiPublished in: CoRR (2022)
Keyphrases
- learning algorithm
- detection algorithm
- linear complexity
- improved algorithm
- optimization algorithm
- preprocessing
- tree structure
- dynamic programming
- computational cost
- experimental evaluation
- matching algorithm
- worst case
- convex hull
- search space
- optimal solution
- times faster
- decision trees
- closed form
- recognition algorithm
- binary tree
- theoretical analysis
- np hard
- cost function
- significant improvement
- evolutionary algorithm
- computationally efficient
- expectation maximization
- particle swarm optimization
- input data
- linear programming
- graphical models
- high accuracy
- probabilistic model
- mobile robot