1493 search results - page 47 / 299 » Local resilience of graphs |
129
click to vote
KDD
2007
ACM
16 years 29 days ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
88
Voted
SIAMDM
2008
15 years 14 days ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
84
Voted
ECEASST
2008
15 years 19 days ago
2008
Abstract: A triangulated network of mobile units is modelled by means of a graph transformation system in which graph nodes are labelled with geometric coordinates and edges are la...
116
Voted
IEEEARES
2006
IEEE
15 years 6 months ago
2006
IEEE
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the netwo...
103
click to vote
CIIT
2004
15 years 1 months ago
2004
This paper presents a novel swarm intelligence inspired routing algorithm (EARA) for mobile ad hoc networks. Based on the understanding of the evolutionary cooperation in the biol...