An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure

Published 2015 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure
Authors
Keywords
Traveling salesman problem, Exact exponential algorithm, Graph algorithm, Connectivity, Measure and conquer
Journal
ALGORITHMICA
Volume 74, Issue 2, Pages 713-741
Publisher
Springer Nature
Online
2015-02-04
DOI
10.1007/s00453-015-9970-4
References
View 2 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.