z-logo
open-access-imgOpen Access
The Traveling Salesman Problem for Cubic Graphs
Author(s) -
David Eppstein
Publication year - 2007
Publication title -
journal of graph algorithms and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.387
H-Index - 38
ISSN - 1526-1719
DOI - 10.7155/jgaa.00137
Subject(s) - travelling salesman problem , hamiltonian path , combinatorics , hamiltonian path problem , mathematics , cubic graph , discrete mathematics , graph , quartic graph , hamiltonian (control theory) , bottleneck traveling salesman problem , graph power , algorithm , line graph , mathematical optimization , voltage graph

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom