1154 search results - page 122 / 231 » On the editing distance of graphs |
ASUNAM
2009
IEEE
14 years 4 months ago
2009
IEEE
A user profile on an online social network is characterized by its profile entries (keywords). In this paper, we study the relationship between semantic similarity of user keywo...
IROS
2006
IEEE
14 years 4 months ago
2006
IEEE
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
SPAA
2005
ACM
14 years 3 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
SPDP
1990
IEEE
14 years 2 months ago
1990
IEEE
In this paper, we propose a semi distributed approach, for load balancing in large parallel and distributedsystems. Theproposedschemeisa twolevel hierarchical scheme which partiti...
CCCG
2009
13 years 11 months ago
2009
All known examples of generic 3D bar-and-joint frameworks where the distance between a non-edge pair is implied by the edges in the graph contain a rigid vertexinduced subgraph. I...