Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP.
Bahman KalantariGholamreza B. KhosrovshahiPublished in: Networks (1996)
Keyphrases
- worst case
- traveling salesman problem
- graph theoretic
- lower bound
- upper bound
- image segmentation
- average case
- active learning
- reachability queries
- decision problems
- ant colony optimization
- np hard
- optimal solution
- directed graph
- graph matching
- graph model
- graph databases
- computational complexity
- representational power
- neural network