3267 search results - page 169 / 654 » Generalized quasirandom graphs |
153
Voted
CPC
2006
15 years 6 months ago
2006
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...
145
Voted
DAM
2006
15 years 6 months ago
2006
We observe that a formula given by S. Negami [Trans. Amer. Math. Soc. 299 (1987), 601-622] for the Tutte polynomial of a k-sum of two graphs generalizes to a colored Tutte polynom...
170
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied verte...
155
Voted
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
135
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— We study averaging algorithms, when implemented in large networks of wirelessly connected elements. We extend the notion of “Increasing Correctness” (IC) which was ...