Sciweavers

1206 search results - page 40 / 242
» Arc-Flags in Dynamic Graphs
Sort
View
IPPS
2003
IEEE
14 years 3 months ago
An Extended Link Reversal Protocol in Dynamic Networks
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
Jie Wu, Fei Dai
COMGEO
1999
ACM
13 years 9 months ago
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid
ICSE
2009
IEEE-ACM
13 years 7 months ago
A model for dynamic and adaptable services management
The dynamic nature of Service-Oriented Architectures challenges traditional systems management practices which tend to be static in nature. We propose a goal-oriented, agent-based...
Patrick Martin, Wendy Powley, Imad Abdallah, Jun L...
IJBC
2006
130views more  IJBC 2006»
13 years 10 months ago
Automatic Generation of Self-Replicating Patterns in Graph Automata
Graph automata define symbol dynamics on graph structures, which has capability of generating structures in addition to state transition. The rules of the graph automata are unifo...
Kohji Tomita, Haruhisa Kurokawa, Satoshi Murata
JGAA
2007
88views more  JGAA 2007»
13 years 9 months ago
Dynamic Spectral Layout with an Application to Small Worlds
Spectral methods are naturally suited for dynamic graph layout because, usually, moderate changes of a graph yield moderate changes of the layout. We discuss some general principl...
Ulrik Brandes, Daniel Fleischer, Thomas Puppe