Sciweavers

1756 search results - page 104 / 352
» Directed scale-free graphs
Sort
View
CSE
2009
IEEE
14 years 2 months ago
Structure of Neighborhoods in a Large Social Network
Abstract—We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph t...
Alina Stoica, Christophe Prieur
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
14 years 10 days ago
Improving coverage analysis and test generation for large designs
State space techniques have proven to be useful for measuring and improving the coverage of test vectors that are used during functional validation via simulation. By comparing th...
Jules P. Bergmann, Mark Horowitz
APPROX
2008
Springer
75views Algorithms» more  APPROX 2008»
13 years 10 months ago
On the Query Complexity of Testing Orientations for Being Eulerian
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
Eldar Fischer, Oded Lachish, Ilan Newman, Arie Mat...
CCCG
2008
13 years 9 months ago
A Distributed Algorithm for Computing Voronoi Diagram in the Unit Disk Graph Model
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
Yurai Núñez Rodríguez, Henry ...
CPC
2006
93views more  CPC 2006»
13 years 8 months ago
Distribution of Vertex Degree in Web-Graphs
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...
Colin Cooper