2310 search results - page 357 / 462 » Coloring Random Graphs |
140
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— Previous analytical studies [12], [18] of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this ...
131
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
—We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix w...
145
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
140
click to vote
ACMSE
2006
ACM
15 years 10 months ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
161
click to vote
VALUETOOLS
2006
ACM
15 years 10 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...