Sciweavers

659 search results - page 38 / 132
» Dynamic Algorithms for Graph Spanners
Sort
View
ICDM
2007
IEEE
197views Data Mining» more  ICDM 2007»
14 years 1 months ago
Trend Motif: A Graph Mining Approach for Analysis of Dynamic Complex Networks
Complex networks have been used successfully in scientific disciplines ranging from sociology to microbiology to describe systems of interacting units. Until recently, studies of...
Ruoming Jin, Scott McCallen, Eivind Almaas
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
14 years 7 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
VEE
2012
ACM
187views Virtualization» more  VEE 2012»
12 years 3 months ago
DDGacc: boosting dynamic DDG-based binary optimizations through specialized hardware support
Dynamic Binary Translators (DBT) and Dynamic Binary Optimization (DBO) by software are used widely for several reasons including performance, design simplification and virtualiza...
Demos Pavlou, Enric Gibert, Fernando Latorre, Anto...
ISPA
2004
Springer
14 years 28 days ago
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...
Changtao Qu, Wolfgang Nejdl, Matthias Kriesell
ESA
2004
Springer
137views Algorithms» more  ESA 2004»
14 years 28 days ago
Fast 3-Coloring Triangle-Free Planar Graphs
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
Lukasz Kowalik