A linear algorithm for minimum 1-identifying codes in oriented trees.
Irène CharonSylvain GravierOlivier HudryAntoine LobsteinMichel MollardJulien MoncelPublished in: Discret. Appl. Math. (2006)
Keyphrases
- high accuracy
- learning algorithm
- cost function
- detection algorithm
- tree structure
- experimental evaluation
- significant improvement
- times faster
- search space
- dynamic programming
- convergence rate
- linear complexity
- optimal solution
- segmentation algorithm
- computationally efficient
- closed form
- expectation maximization
- optimization algorithm
- theoretical analysis
- linear programming
- worst case
- k means
- preprocessing
- computational complexity
- genetic algorithm
- probabilistic model
- convex hull
- recognition algorithm
- piecewise linear
- transfer function
- global minimum
- search algorithm
- square error