1493 search results - page 47 / 299 » Local resilience of graphs |
KDD
2007
ACM
14 years 8 months 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...
SIAMDM
2008
13 years 7 months 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...
ECEASST
2008
13 years 7 months 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...
IEEEARES
2006
IEEE
14 years 1 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...
CIIT
2004
13 years 9 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...