The traveling salesman problem for cubic graphs.

Eppstein, David

Journal of Graph Algorithms and Applications (2007)

  • Volume: 11, Issue: 1, page 61-81
  • ISSN: 1526-1719

How to cite

top

Eppstein, David. "The traveling salesman problem for cubic graphs.." Journal of Graph Algorithms and Applications 11.1 (2007): 61-81. <http://eudml.org/doc/55409>.

@article{Eppstein2007,
author = {Eppstein, David},
journal = {Journal of Graph Algorithms and Applications},
keywords = {minimum weight Hamiltonian cycle},
language = {eng},
number = {1},
pages = {61-81},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {The traveling salesman problem for cubic graphs.},
url = {http://eudml.org/doc/55409},
volume = {11},
year = {2007},
}

TY - JOUR
AU - Eppstein, David
TI - The traveling salesman problem for cubic graphs.
JO - Journal of Graph Algorithms and Applications
PY - 2007
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 11
IS - 1
SP - 61
EP - 81
LA - eng
KW - minimum weight Hamiltonian cycle
UR - http://eudml.org/doc/55409
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.