Sciweavers

1056 search results - page 68 / 212
» Constraint-Based Graph Matching
Sort
View
SDM
2009
SIAM
113views Data Mining» more  SDM 2009»
14 years 6 months ago
Graph Generation with Prescribed Feature Constraints.
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...
Xiaowei Ying, Xintao Wu
GBRPR
2007
Springer
14 years 1 months ago
Constellations and the Unsupervised Learning of Graphs
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...
Boyan Bonev, Francisco Escolano, Miguel Angel Loza...
JGT
2006
60views more  JGT 2006»
13 years 9 months ago
Spanning subgraphs of graphs partitioned into two isomorphic pieces
: 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...
Anthony Bonato
DMTCS
2010
157views Mathematics» more  DMTCS 2010»
13 years 6 months ago
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
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...
Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monro...
JEI
2006
82views more  JEI 2006»
13 years 9 months ago
Real-time mosaic using sequential graph
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...
Dae Woong Kim, Ki-Sang Hong