2270 search results - page 26 / 454 » On the distribution of eigenvalues of graphs |
180
click to vote
TKDE
2012
13 years 4 months ago
2012
— Most proposed DHTs engage certain topology maintenance mechanisms specific to the static graphs on which they are based. The designs of these mechanisms are complicated and rep...
113
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
Graph alliances are recently developed global properties of any symmetric graph. Our purpose in the present paper is to design self-stabilizing fault tolerant distributed algorith...
101
Voted
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
In the theoretical framework of graph embedding and network emulations, we show that the index-shuffle graph (a bounded-degreehypercube-like interconnection network, recently intr...
114
click to vote
ENTCS
2006
15 years 1 months ago
2006
Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and ...
132
click to vote
KDD
2008
ACM
16 years 2 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...