Sciweavers

5922 search results - page 155 / 1185
» Navigability of Complex Networks
Sort
View
119
Voted
PRDC
2008
IEEE
15 years 7 months ago
On the Complexity of a Self-Stabilizing Spanning Tree Algorithm for Large Scale Systems
Many large scale systems, like grids and structured peer to peer systems, operate on a constrained topology. Since underlying networks do not expose the real topology to the appli...
Julien Clement, Thomas Hérault, Stép...
111
Voted
ICECCS
2005
IEEE
87views Hardware» more  ICECCS 2005»
15 years 6 months ago
Scavenging Complex Genomic Information Using Mobile Code: An Evaluation
Mobile code solutions can improve the performances of applications over the Internet by reducing the amount of data that must be transferred across the network. The research on ge...
Mauro Pezzè, Davide Tosi, Gian Pietro Picco
117
Voted
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
15 years 6 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
111
Voted
ISMAR
2003
IEEE
15 years 6 months ago
Using Augmented Reality for Visualizing Complex Graphs in Three Dimensions
In this paper we explore the effect of using Augmented Reality for three-dimensional graph link analysis. Two experiments were conducted. The first was designed to compare a tangi...
Daniel Belcher, Mark Billinghurst, Sean Hayes, Ran...
113
Voted
CIAC
2010
Springer
246views Algorithms» more  CIAC 2010»
15 years 4 months ago
Capacitated Confluent Flows: Complexity and Algorithms
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
Daniel Dressler and Martin Strehler