1327 search results - page 14 / 266 » Path following algorithm for the graph matching problem |
400
click to vote
COCOON
2011
Springer
14 years 5 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
149
click to vote
ICDM
2005
IEEE
15 years 11 months ago
2005
IEEE
We consider the problem of elastic matching of time series. We propose an algorithm that determines a subsequence of a target time series that best matches a query series. In the ...
150
click to vote
COCOON
1999
Springer
15 years 9 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
151
Voted
JAL
2006
15 years 5 months ago
2006
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...