Sciweavers

218 search results - page 12 / 44
» Connectivity graphs as models of local interactions
Sort
View
GG
2008
Springer
13 years 8 months ago
Labelled (Hyper)Graphs, Negotiations and the Naming Problem
We consider four different models of process interactions that unify and generalise models introduced and studied by Angluin et al. [AAD+ 04] and models introduced and studied by ...
Jérémie Chalopin, Antoni W. Mazurkie...
SSDBM
2010
IEEE
185views Database» more  SSDBM 2010»
13 years 6 months ago
DESSIN: Mining Dense Subgraph Patterns in a Single Graph
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
Shirong Li, Shijie Zhang, Jiong Yang
CIKM
2004
Springer
14 years 1 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel
GG
2008
Springer
13 years 8 months ago
Formal Analysis of Model Transformations Based on Triple Graph Rules with Kernels
Abstract. Triple graph transformation has become an important approach for model transformations. Triple graphs consist of a source, a target and a connection graph. The correspond...
Hartmut Ehrig, Ulrike Prange
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 1 months ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
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...
Yu Wang 0003, Xiang-Yang Li