Sciweavers

1493 search results - page 110 / 299
» Local resilience of graphs
Sort
View
CONEXT
2008
ACM
13 years 9 months ago
Power-law chord architecture in P2P overlays
In this paper, we propose to extend the topology of Chord to a bidirectional graph to provide a super-peer based lookup algorithm and an efficient resource localization service at...
Salma Ktari, Artur Hecker, Houda Labiod
DM
2006
60views more  DM 2006»
13 years 8 months ago
On cycles through specified vertices
For a set X of vertices of a graph fulfilling local connectedness conditions the existence of a cycle containing X is proved. AMS classification: 05C38, 05C45, 05C35
Tobias Gerlach, Frank Göring, Jochen Harant, ...
SIROCCO
2008
13 years 9 months ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
CP
2009
Springer
14 years 8 months ago
Constraint-Based Graph Matching
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...
Christine Solnon, Vianney le Clément, Yves ...
TVCG
2012
196views Hardware» more  TVCG 2012»
11 years 10 months ago
Ambiguity-Free Edge-Bundling for Interactive Graph Visualization
—Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational datasets (e.g., transportation networks, ...
Sheng-Jie Luo, Chun-Liang Liu, Bing-Yu Chen, Kwan-...