Approximating TSP walks in subcubic graphs.
Michael C. WigalYoungho YooXingxing YuPublished in: J. Comb. Theory, Ser. B (2023)
Keyphrases
- traveling salesman problem
- travelling salesman
- graph theoretic
- graph matching
- graph theory
- ant colony optimization
- optimal solution
- adjacency matrix
- combinatorial optimization
- graph isomorphism
- subgraph isomorphism
- graph construction
- graph kernels
- complex structures
- genetic algorithm
- information systems
- graph representation
- search space
- graph mining
- bayesian networks
- data sets
- directed graph
- np hard