1370 search results - page 130 / 274 » On grids in topological graphs |
143
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
In this paper, a novel approach to Mathematical Morphology operations is proposed. Morphological operators based on partial differential equations (PDEs) are extended to weighted ...
174
click to vote
ICAPR
2005
Springer
15 years 12 months ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
196
click to vote
CCCG
2010
15 years 8 months ago
2010
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
149
click to vote
ESANN
2003
15 years 7 months ago
2003
We propose the use of the Gabriel graph for the exploratory analysis of potentially high dimensional labeled data. Gabriel graph is a subgraph of the Delaunay triangulation, which ...
171
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...