83 search results - page 8 / 17 » An Improved Exact Algorithm for Cubic Graph TSP |
JMLR
2010
13 years 2 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
JAIR
2010
13 years 2 months ago
2010
The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first problems used for studying intrinsic properties, i...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
ICCSA
2004
Springer
14 years 26 days ago
2004
Springer
The algorithmic techniques which allow high efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges are ...
ESOP
2000
Springer
13 years 11 months ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...