2503 search results - page 58 / 501 » A study of 3-arc graphs |
163
click to vote
SPAA
2000
ACM
15 years 10 months ago
2000
ACM
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper),...
191
click to vote
JUCS
2008
15 years 5 months ago
2008
: In the paper we study parallel key exchange among multiple parties. The status of parallel key exchange can be depicted by a key graph. In a key graph, a vertex represents a part...
182
click to vote
ICDM
2009
IEEE
15 years 3 months ago
2009
IEEE
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
153
click to vote
WWW
2007
ACM
16 years 6 months ago
2007
ACM
We present a family of measures of proximity of an arbitrary node in a directed graph to a pre-specified subset of nodes, called the anchor. Our measures are based on three differ...
138
click to vote
WWW
2005
ACM
16 years 6 months ago
2005
ACM
This paper shows how a corpus of instant messages can be employed to detect de facto communities of practice automatically. A novel algorithm based on the concept of Edge Stress F...