Sciweavers

2899 search results - page 108 / 580
» Dynamic Trees in Practice
Sort
View
IFIP
2004
Springer
14 years 2 months ago
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
Paola Flocchini, Antonio Mesa Enriques, Linda Pagl...
CORR
2007
Springer
165views Education» more  CORR 2007»
13 years 9 months ago
Comparison of Tree-Child Phylogenetic Networks
Abstract—Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of non-treelike evolutionary events, like recombination, hybridization...
Gabriel Cardona, Francesc Rosselló, Gabriel...
SIAMNUM
2010
123views more  SIAMNUM 2010»
13 years 3 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 3 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 3 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