A simple linear time algorithm to solve the MIST problem on interval graphs.
Peng LiJianhui ShangYi ShiPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- detection algorithm
- optimization algorithm
- preprocessing
- dynamic programming
- matching algorithm
- worst case
- cost function
- graph isomorphism
- times faster
- computational cost
- experimental evaluation
- computational complexity
- objective function
- improved algorithm
- graph model
- graph construction
- probabilistic model
- particle swarm optimization
- np hard
- optimal solution
- learning algorithm
- simulated annealing
- high accuracy
- neural network
- k means