10051 search results - page 124 / 2011 » A Dynamic Separator Algorithm |
117
click to vote
WG
2005
Springer
15 years 7 months ago
2005
Springer
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
109
click to vote
ICARIS
2010
Springer
15 years 24 days ago
2010
Springer
Abstract. This paper presents a high level dynamic task allocation algorithm that is inspired by the biological development process and the immune system. For a microprocessor (µP...
137
click to vote
COMPGEOM
2001
ACM
15 years 6 months ago
2001
ACM
We show how to maintain the width of a set of n planar points subject to insertions and deletions of points in O( n log3 n) amortized time per update. Previously, no fully dynami...
102
click to vote
FODO
1993
Springer
15 years 6 months ago
1993
Springer
Abstract. DDH extends the idea of dynamic hashing algorithms to distributed systems. DDH spreads data across multiple servers in a network using a novel autonomous location discove...
125
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...