1327 search results - page 11 / 266 » Path following algorithm for the graph matching problem |
IEICET
2006
14 years 9 months ago
2006
123
click to vote
ICCV
2005
IEEE
15 years 3 months ago
2005
IEEE
Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical co...
EVOW
2006
Springer
15 years 1 months ago
2006
Springer
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph si...
101
Voted
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
CIKM
2007
Springer
15 years 3 months ago
2007
Springer
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...