Sciweavers

4137 search results - page 16 / 828
» On the number of matchings of a tree
Sort
View
SODA
1998
ACM
98views Algorithms» more  SODA 1998»
13 years 9 months ago
Finger Search Trees with Constant Insertion Time
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
Gerth Stølting Brodal
RECOMB
2009
Springer
14 years 8 months ago
Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information
Abstract. Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotation information for som...
Saket Navlakha, James Robert White, Niranjan Nagar...
FOCS
1989
IEEE
13 years 11 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
DM
2000
81views more  DM 2000»
13 years 7 months ago
The optimal pebbling number of the complete m-ary tree
In this paper, we
Hung-Lin Fu, Chin-Lin Shiue
NETWORKS
2008
13 years 7 months ago
The number of spanning trees in a class of double fixed-step loop networks
In this paper, we develop a method to count the number of spanning trees in certain classes of double fixed-step loop networks with nonconstant steps. More specifically our techni...
Xuerong Yong, Yuanping Zhang, Mordecai J. Golin