The Asymmetric Travelling Salesman Problem In Sparse Digraphs. (Q6089670): Difference between revisions

@@ Property / cites work @@
+Inclusion and exclusion algorithm for the Hamiltonian path problem
+Normal rank
@@ Property / cites work @@
+Dynamic Programming Treatment of the Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Determinant Sums for Undirected Hamiltonicity
@@ Property / cites work: Determinant Sums for Undirected Hamiltonicity / rank @@
+Normal rank
@@ Property / cites work @@
+Q5090992
@@ Property / cites work: Q5090992 / rank @@
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem in bounded degree graphs
+Normal rank
@@ Property / cites work @@
+Spotting Trees with Few Leaves
@@ Property / cites work: Spotting Trees with Few Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Directed Hamiltonicity and Out-Branchings via Generalized Laplacians
+Normal rank
@@ Property / cites work @@
+Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors
+Normal rank
@@ Property / cites work @@
+Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
+Normal rank
@@ Property / cites work @@
+Fast Hamiltonicity Checking Via Bases of Perfect Matchings
+Normal rank
@@ Property / cites work @@
+Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
+Normal rank
@@ Property / cites work @@
+Faster exponential-time algorithms in graphs of bounded average degree
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem for Cubic Graphs
@@ Property / cites work: The Traveling Salesman Problem for Cubic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On two techniques of combining branching and treewidth
+Normal rank
@@ Property / cites work @@
+Finding all the perfect matchings in bipartite graphs
+Normal rank
@@ Property / cites work @@
+On the Number of Hamilton Cycles in Bounded Degree Graphs
+Normal rank
@@ Property / cites work @@
+Finding and enumerating Hamilton cycles in 4-regular graphs
+Normal rank
@@ Property / cites work @@
+Expected Computation Time for Hamiltonian Path problem
+Normal rank
@@ Property / cites work @@
+Dynamic programming meets the principle of inclusion and exclusion
+Normal rank
@@ Property / cites work @@
+A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms
+Normal rank
@@ Property / cites work @@
+Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
+Normal rank
@@ Property / cites work @@
+A Search Procedure for Hamilton Paths and Circuits
+Normal rank
@@ Property / cites work @@
+A short proof of Minc's conjecture
@@ Property / cites work: A short proof of Minc's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure
+Normal rank
@@ Property / cites work @@
+An improved exact algorithm for TSP in graphs of maximum degree 4
+Normal rank
@@ Property / cites work @@
+A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs
+Normal rank