829 search results - page 140 / 166 » Distance domination-critical graphs |
DIALM
2005
ACM
15 years 1 months ago
2005
ACM
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
116
click to vote
PAMI
2006
14 years 11 months ago
2006
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
108
click to vote
SPE
2008
14 years 11 months ago
2008
composed of various graphs linked together by relations of abstraction/refinement. The new structure is useful for representing information that can be described at t levels of abs...
103
click to vote
SODA
2007
ACM
15 years 1 months ago
2007
ACM
We introduce the concept of region-fault tolerant spanners for planar point sets, and prove the existence of region-fault tolerant spanners of small size. For a geometric graph G ...
ESWS
2006
Springer
15 years 3 months ago
2006
Springer
We present a new iterative algorithm for ontology mapping where we combine standard string distance metrics with a structural similarity measure that is based on a vector represent...