143 citations · 198 across the 19 of their papers we have counts for
1 paper · 1 filter
Mingyu Xiao, Hiroshi Nagamochi
The paper presents an O^*(1.2312^n)-time and polynomial-space algorithm for the traveling salesman problem in an n-vertex graph with maximum degree 3. This improves the previous ti…