4926 search results - page 212 / 986 » Two Graph Algorithms On an Associative Computing Model |
157
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
168
click to vote
ESWS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We think of Match as an operator which takes two graph-like structures and produces a mapping between those nodes of the two graphs that correspond semantically to each o...
185
click to vote
JODS
2007
15 years 6 months ago
2007
We view match as an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond sema...
215
Voted
DIALM
2003
ACM
15 years 11 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
130
Voted
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
In this paper we propose a novel method for generic object localization. The method is based on modeling the object as a graph at two levels: a local substructural representation ...