659 search results - page 15 / 132 » Dynamic Algorithms for Graph Spanners |
SWAT
2000
Springer
15 years 5 months ago
2000
Springer
108
Voted
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
107
click to vote
WEA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
118
click to vote
PLDI
2004
ACM
15 years 7 months ago
2004
ACM
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
115
click to vote
CHI
2010
ACM
15 years 9 months ago
2010
ACM
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...