Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-Shortest Induced Paths.
Yung-Chung ChiuHsueh-I LuPublished in: STACS (2022)
Keyphrases
- preprocessing
- learning algorithm
- search space
- experimental evaluation
- optimal solution
- dynamic programming
- computational cost
- computational complexity
- recognition algorithm
- detection algorithm
- np hard
- linear programming
- worst case
- optimization algorithm
- improved algorithm
- computationally efficient
- highly efficient
- path length
- significant improvement
- memory efficient
- data sets
- convergence rate
- tree structure
- segmentation algorithm
- particle swarm optimization
- high accuracy
- data structure