1327 search results - page 103 / 266 » Path following algorithm for the graph matching problem |
138
click to vote
CPHYSICS
2011
14 years 5 months ago
2011
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
111
click to vote
APPROX
2010
Springer
15 years 3 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
203
click to vote
GIS
2009
ACM
16 years 3 months ago
2009
ACM
Map-matching is the process of aligning a sequence of observed user positions with the road network on a digital map. It is a fundamental pre-processing step for many applications...
149
click to vote
SAC
2003
ACM
15 years 7 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
124
click to vote
COLOGNETWENTE
2009
15 years 3 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...