Polynomial Time Algorithm for ARRIVAL on Tree-like Multigraphs.
David AugerPierre CoucheneyLoric DuhazePublished in: CoRR (2022)
Keyphrases
- learning algorithm
- computational complexity
- tree structure
- cost function
- dynamic programming
- worst case
- times faster
- computational cost
- matching algorithm
- optimal solution
- segmentation algorithm
- experimental evaluation
- k means
- binary tree
- preprocessing
- objective function
- pattern matching
- high accuracy
- clustering method
- minimum spanning tree
- min cost
- detection algorithm
- optimization algorithm
- expectation maximization
- linear programming
- simulated annealing
- significant improvement
- search space
- similarity measure