An Algorithm to Solve the Partition into Perfect Matchings Problem in Halin Graphs.
Yunting LuDingjun LouPublished in: International Conference on Computational Science (3) (2007)
Keyphrases
- detection algorithm
- learning algorithm
- improved algorithm
- preprocessing
- search space
- times faster
- simulated annealing
- objective function
- optimization algorithm
- computational cost
- computational complexity
- high accuracy
- linear programming
- experimental evaluation
- np hard
- tree structure
- matching algorithm
- significant improvement
- convergence rate
- graph structure
- minimum spanning tree
- random graphs
- adjacency graph
- max cut
- finding the shortest path