Sciweavers

1493 search results - page 58 / 299
» Local resilience of graphs
Sort
View
ACSW
2007
13 years 9 months ago
DGRID: A DHT-Based Resource Indexing and Discovery Scheme for Computational Grids
Traditional DHT (Distributed Hash Tables) abstraction distributes data items among peer nodes on a structured overlay network. This introduces a number of issues when nodes are un...
Verdi March, Yong Meng Teo, Xianbing Wang
CGF
2004
92views more  CGF 2004»
13 years 7 months ago
Para-Graph: Graph-Based Parameterization of Triangle Meshes with Arbitrary Genus
This paper describes a novel approach to the parameterization of triangle meshes representing 2-manifolds with an arbitrary genus. A topology-based decomposition of the shape is c...
Giuseppe Patanè, Michela Spagnuolo, Bianca ...
INFORMS
2008
241views more  INFORMS 2008»
13 years 7 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
GG
2004
Springer
14 years 1 months ago
Fundamental Theory for Typed Attributed Graph Transformation
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no ade...
Hartmut Ehrig, Ulrike Prange, Gabriele Taentzer
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
13 years 11 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch