617 search results - page 77 / 124 » On the Chromatic Number of Random Graphs |
179
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
138
click to vote
ALT
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
147
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
122
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Non-adaptive group testing involves grouping arbitrary subsets of n items into different pools. Each pool is then tested and defective items are identified. A fundamental question...
139
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...