Sciweavers

659 search results - page 18 / 132
» Dynamic Algorithms for Graph Spanners
Sort
View
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul
IJICT
2007
143views more  IJICT 2007»
13 years 7 months ago
A parallel algorithm for dynamic slicing of distributed Java programs in non-DSM systems
We propose a parallel algorithm for dynamic slicing of distributed Java programs. Given a distributed Java program, we first construct an intermediate representation in the form o...
Durga Prasad Mohapatra, Rajib Mall, Rajeev Kumar
TVCG
2012
182views Hardware» more  TVCG 2012»
11 years 10 months ago
Coherent Time-Varying Graph Drawing with Multifocus+Context Interaction
—We present a new approach for time-varying graph drawing that achieves both spatiotemporal coherence and multifocus+context visualization in a single framework. Our approach uti...
Kun-Chuan Feng, Chaoli Wang, Han-Wei Shen, Tong-Ye...
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
14 years 26 days ago
On Dynamic Shortest Paths Problems
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
Liam Roditty, Uri Zwick
ISCI
2007
96views more  ISCI 2007»
13 years 7 months ago
A new algorithm for removing node overlapping in graph visualization
Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, p...
Xiaodi Huang, Wei Lai, A. S. M. Sajeev, Junbin Gao