Skip Nav Destination
Close Modal
Update search
Filter
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- ISBN-10
- ISSN
- EISSN
- Issue
- Journal Volume Number
- References
- Conference Volume Title
- Paper No
Filter
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- ISBN-10
- ISSN
- EISSN
- Issue
- Journal Volume Number
- References
- Conference Volume Title
- Paper No
Filter
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- ISBN-10
- ISSN
- EISSN
- Issue
- Journal Volume Number
- References
- Conference Volume Title
- Paper No
Filter
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- ISBN-10
- ISSN
- EISSN
- Issue
- Journal Volume Number
- References
- Conference Volume Title
- Paper No
Filter
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- ISBN-10
- ISSN
- EISSN
- Issue
- Journal Volume Number
- References
- Conference Volume Title
- Paper No
Filter
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- ISBN-10
- ISSN
- EISSN
- Issue
- Journal Volume Number
- References
- Conference Volume Title
- Paper No
NARROW
Format
Article Type
Topics
Date
Availability
1-1 of 1
Keywords: travelling salesman problems
Close
Follow your search
Access your saved searches in your account
Would you like to receive an alert when new items match your search?
Sort by
Journal Articles
Article Type: Article
J. Comput. Inf. Sci. Eng. March 2005, 5(1): 18–24.
Published Online: March 14, 2005
... algorithms for isomorphism identification despite its nondeterministic polynomial (NP) hard nature. First, based on the rearrangement of the vertexes in kinematic chains, the isomorphism identification of kinematic chains is transformed into a degree-reducible traveling salesman problem (TSP), so...
