Sciweavers

685 search results - page 46 / 137
» Succinct Trees in Practice
Sort
View
SIAMNUM
2010
123views more  SIAMNUM 2010»
13 years 2 months ago
Critical Analysis of the Spanning Tree Techniques
Two algorithms based upon a tree-cotree decomposition, called in this paper spanning tree technique (STT) and generalized spanning tree technique (GSTT), have been shown to be usef...
Pawel Dlotko, Ruben Specogna
ISAAC
2009
Springer
101views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Maintaining Nets and Net Trees under Incremental Motion
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
Minkyoung Cho, David M. Mount, Eunhui Park
ACSC
2007
IEEE
14 years 2 months ago
Compact Layout of Layered Trees
The standard layered drawing convention for trees in which the vertical placement of a node is given by its level in the tree and each node is centered between its children can le...
Kim Marriott, Peter Sbarski
TAMC
2007
Springer
14 years 1 months ago
Approximately Optimal Trees for Group Key Management with Batch Updates
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
Minming Li, Ze Feng, Ronald L. Graham, Frances F. ...
ICPADS
2005
IEEE
14 years 1 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan