2270 search results - page 33 / 454 » On the distribution of eigenvalues of graphs |
125
click to vote
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
105
click to vote
HPCC
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
124
click to vote
WDAG
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
134
click to vote
AGTIVE
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. In the paper Support for Design Patterns through Graph Transformation Tools in this volume, we have already outlined the global structure of a tool that allows for the an...
ENDM
2002
15 years 1 months ago
2002
The probability distribution on a set S = { 1, 2, . . . , n } defined by Pr(k) = 1/(Hnk), where Hn in the nth harmonic number, is commonly called a Zipfian distribution. In this no...