Back to Results
First PageMeta Content
NP-complete problems / Hamiltonian path / Line graph / Path / Cubic graph / Graph / Travelling salesman problem / Matching / Neighbourhood / Graph theory / Mathematics / Theoretical computer science


Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 11, no. 1, pp. 61–[removed])
Add to Reading List

Document Date: 2007-05-02 06:33:52


Open Document

File Size: 298,37 KB

Share Result on Facebook

City

Ottawa / /

Country

United States / /

/

Facility

Cubic Graphs David Eppstein Computer Science Department University of California / /

IndustryTerm

minimum spanning tree algorithm / dynamic programming algorithm / salesman algorithm / exponential-time solutions / cycle listing algorithm / randomized and deterministic algorithms / overall algorithm / naive branching search / /

Organization

National Science Foundation / University of California / Irvine / Cubic Graphs David Eppstein Computer Science Department University / /

Person

B. Mitchell Submitted April / /

Position

salesman / The Traveling Salesman Problem / traveling salesman / /

ProgrammingLanguage

TSP / /

ProvinceOrState

California / /

Technology

Correctness Our algorithm / dynamic programming algorithm / 2 The algorithm / cycle listing algorithm / randomized and deterministic algorithms / overall algorithm / traveling salesman algorithm / 4 The algorithm / TSP algorithm / 1 The algorithm / minimum spanning tree algorithm / /

URL

http /

SocialTag