A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs.
Xinyu WuYi ZhouJin-Kao HaoZhang-Hua FuPublished in: CoRR (2022)
Keyphrases
- detection algorithm
- dynamic programming
- computational complexity
- experimental evaluation
- cost function
- learning algorithm
- preprocessing
- recognition algorithm
- np hard
- graph isomorphism
- minimum spanning tree
- linear programming
- simulated annealing
- high accuracy
- worst case
- optimization algorithm
- probabilistic model
- matching algorithm
- significant improvement
- objective function
- gradient projection
- similarity measure