2270 search results - page 50 / 454 » On the distribution of eigenvalues of graphs |
128
click to vote
IAT
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
137
click to vote
OPODIS
2001
15 years 3 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
101
click to vote
ICDE
2005
IEEE
15 years 7 months ago
2005
IEEE
In this paper we show that the topologies of most logarithmic-style P2P systems like Pastry, Tapestry or P-Grid resemble small-world graphs. Inspired by Kleinberg’s small-world ...
101
click to vote
CPC
2006
15 years 2 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...
110
click to vote
SPAA
2009
ACM
15 years 8 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...