83 search results - page 1 / 17 » An Improved Exact Algorithm for Cubic Graph TSP |
COCOON
2007
Springer
13 years 10 months ago
2007
Springer
It is shown that the traveling salesman problem for graphs
WALCOM
2008
IEEE
13 years 6 months ago
2008
IEEE
Abstract. Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...
RSA
2008
13 years 4 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
WAOA
2007
Springer
13 years 10 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...