An Improved Analysis of the Mömke-Svensson Algorithm for Graph-TSP on Subquartic Graphs.
Alantha NewmanPublished in: ESA (2014)
Keyphrases
- graph structure
- optimal solution
- np hard
- minimum spanning tree
- adjacency graph
- graph construction
- graph search
- ant colony optimization
- undirected graph
- graph model
- subgraph isomorphism
- graph matching
- traveling salesman problem
- hamiltonian cycle
- graph isomorphism
- graph matching algorithm
- random graphs
- learning algorithm
- graph partitioning
- simulated annealing
- graph theoretical
- graph based algorithm
- finding the shortest path
- graph representation
- matching algorithm
- search space
- genetic algorithm
- graph theoretic
- strongly connected components
- spectral decomposition
- image segmentation
- polynomial time complexity
- objective function
- hyper graph
- particle swarm optimization
- labeled graphs
- combinatorial optimization
- graph theory
- adjacency matrix
- fully connected