An improved analysis of the Mömke-Svensson algorithm for graph-TSP on subquartic graphs.
Alantha NewmanPublished in: CoRR (2014)
Keyphrases
- graph structure
- np hard
- learning algorithm
- optimal solution
- graph search
- graph isomorphism
- particle swarm optimization
- hyper graph
- graph theoretical
- graph construction
- random graphs
- minimum spanning tree
- undirected graph
- spanning tree
- polynomial time complexity
- ant colony optimization
- finding the shortest path
- k means
- objective function
- hamiltonian cycle
- inexact graph matching
- adjacency graph
- graph representation
- graph model
- graph matching
- directed graph
- graph structures
- attributed graphs
- graph theory
- graph matching algorithm
- strongly connected components
- np complete
- simulated annealing