Polynomial Time Algorithm for ARRIVAL on Tree-Like Multigraphs.
David AugerPierre CoucheneyLoric DuhazePublished in: MFCS (2022)
Keyphrases
- computational complexity
- tree structure
- experimental evaluation
- learning algorithm
- expectation maximization
- times faster
- preprocessing
- optimal solution
- binary tree
- significant improvement
- cost function
- similarity measure
- detection algorithm
- matching algorithm
- approximation ratio
- optimization algorithm
- polynomial size
- worst case
- probabilistic model
- dynamic programming
- high accuracy
- np hard
- recognition algorithm
- k means
- bayesian networks
- neural network