1056 search results - page 68 / 212 » Constraint-Based Graph Matching |
109
Voted
SDM
2009
SIAM
15 years 12 months ago
2009
SIAM
In this paper, we study the problem of how to generate synthetic graphs matching various properties of a real social network with two applications, privacy preserving social netwo...
136
Voted
GBRPR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an E...
82
Voted
JGT
2006
15 years 2 months ago
2006
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
159
Voted
DMTCS
2010
15 years 3 days ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
116
Voted
JEI
2006
15 years 2 months ago
2006
To prevent large error accumulation in multiple image registration considering real-time applications, we propose a new fast global mosaic method using sequential block matching in...