Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Improved upper bounds for 3-SAT
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Exact and parameterized algorithms for edge dominating set in 3-degree graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Journal of Combinatorial Theory Series B
Finding and enumerating Hamilton cycles in 4-regular graphs
Theoretical Computer Science
Parameterized edge dominating set in cubic graphs
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
The traveling salesman problem in bounded degree graphs
ACM Transactions on Algorithms (TALG)
Fast hamiltonicity checking via bases of perfect matchings
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Parameterized edge dominating set in graphs with degree bounded by 3
Theoretical Computer Science
| Hi-index | 0.00 |
It is shown that the traveling salesman problem for graphs of degree at most three with n vertices can be solved in time O(1.251n), improving the previous bound O(1.260n) by Eppstein.