共查询到20条相似文献,搜索用时 15 毫秒
1.
In this paper we study the rotation transformation on binary trees and consider the properties of binary trees under this operation. The rotation is the universal primitive used to rebalance dynamic binary search trees. New binary search tree algorithms have recently been introduced by Sleator and Tarjan. It has been conjectured that these algorithms are as efficient as any algorithm that dynamically restructures the tree using rotations. We hope that by studying rotations in binary trees we shall gain a better understanding of the nature of binary search trees, which in turn will lead to a proof of this “dynamic optimality conjecture”. We define a graph, RG(n), whose vertex set consists of all binary trees containing n nodes, and which has an edge between two trees if they differ by only one rotation. We shall introduce a new characterization of the structure of RG(n) and use it to demonstrate the existence of a Hamiltonian cycle in the graph. The proof is constructive and can be used to enumerate all binary trees with n nodes in constant time per tree. 相似文献
2.
In this paper, we characterize a class of graphs which can be embedded on a boolean cube. Some of the graphs in this class are identified with the well known graphs such asmulti-dimensional mesh of trees, tree of meshes, etc. We suggest (i) an embedding of anr-dimensional mesh of trees ofn
r
(r+1)–rn
r–1
nodes on a boolean cube of (2n)
r
nodes, and (ii) an embedding of a tree of meshes with 2n
2 logn+n
2 nodes on a boolean cube withn
2 exp2 (log (2 logn+1)]) nodes. 相似文献
3.
Lucas J. M. Vanbaronaigien D. R. Ruskey F. 《Journal of Algorithms in Cognition, Informatics and Logic》1993,15(3)
The rotation graph, Gn, has vertex set consisting of all binary trees with n nodes. Two vertices are connected by an edge if a single rotation will transform one tree into the other. We provide a simpler proof of a result of Lucas that Gn, contains a Hamilton path. Our proof deals directly with the pointer representation of the binary tree. This proof provides the basis of an algorithm for generating all binary trees that can be implemented to run on a pointer machine and to use only constant time between the output of successive trees. Ranking and unranking algorithms are developed for the ordering of binary trees implied by the generation algorithm. These algorithms have time complexity O(n2) (arithmetic operations). We also show strong relationships amongst various representations of binary trees and amongst binary tree generation algorithms that have recently appeared in the literature. 相似文献
4.
Hillel Gazit John H Reif 《Journal of Algorithms in Cognition, Informatics and Logic》1998,28(2):290-314
We present a parallel randomized algorithm running on aCRCW PRAM, to determine whether two planar graphs are isomorphic, and if so to find the isomorphism. We assume that we have a tree of separators for each planar graph (which can be computed by known algorithms inO(log2 n) time withn1 + εprocessors, for any ε > 0). Ifnis the number of vertices, our algorithm takesO(log(n)) time with processors and with a probability of failure of 1/nat most. The algorithm needs 2 · log(m) − log(n) + O(log(n)) random bits. The number of random bits can be decreased toO(log(n)) by increasing the number of processors ton3/2 + ε, for any ε > 0. Our parallel algorithm has significantly improved processor efficiency, compared to the previous logarithmic time parallel algorithm of Miller and Reif (Siam J. Comput.20(1991), 1128–1147), which requiresn4randomized processors orn5deterministic processors. 相似文献
5.
We study the problem of coloring graphs in an online manner. The only known deterministic online graph coloring algorithm with a sublinear performance function was found by [9.], 319–325). Their algorithm colors graphs of chromatic number χ with no more than (2χn)/log* n colors, where n is the number of vertices. They point out that the performance can be improved slightly for graphs with bounded chromatic number. For three-chromatic graphs the number of colors used, for example, is O(n log log log n/log log n). We show that randomization helps in coloring graphs online. We present a simple randomized online algorithm to color graphs with expected number of colors O(2χχ2n(χ−2)/(χ−1)(log n)1/(χ−1)). For three-colorable graphs the expected number of colors our algorithm uses is
. All our algorithms run in polynomial time. It is interesting to note that our algorithm compares well with the best known polynomial time offline algorithms. For instance, the best polynomial time algorithm known for three-colorable graphs, due to [4.] pp. 554–562). We also prove a lower bound of Ω((1/(χ − 1))((log n/(12(χ + 1))) − 1)χ−1) for the randomized model. No lower bound for the randomized model was previously known. For bounded χ, our result improves even the best known lower bound for the deterministic case: Ω((log n/log log n)χ−1), due to Noga Alon (personal communication, September 1989). 相似文献
6.
A graph is locally connected if for each vertex ν of degree ≧2, the subgraph induced by the vertices adjacent to ν is connected. In this paper we establish a sharp threshold function for local connectivity. Specifically, if the probability of an edge of a labeled graph of order n is p = ((3/2 +?n) log n/n)1/2 where ?n = (log log n + log(3/8) + 2x)/(2 log n), then the limiting probability that a random graph is locally connected is exp(-exp(-x)). 相似文献
7.
Noah Forman Soumik Pal Douglas Rizzolo Matthias Winkel 《Random Structures and Algorithms》2020,57(3):745-769
Consider the Aldous Markov chain on the space of rooted binary trees with n labeled leaves in which at each transition a uniform random leaf is deleted and reattached to a uniform random edge. Now, fix 1 ≤ k<n and project the leaf mass onto the subtree spanned by the first k leaves. This yields a binary tree with edge weights that we call a “decorated k‐tree with total mass n.” We introduce label swapping dynamics for the Aldous chain so that, when it runs in stationarity, the decorated k‐trees evolve as Markov chains themselves, and are projectively consistent over k. The construction of projectively consistent chains is a crucial step in the construction of the Aldous diffusion on continuum trees by the present authors, which is the n→∞ continuum analog of the Aldous chain and will be taken up elsewhere. 相似文献
8.
In a digraph with real-valued edge capacities, we pack the greatest number of arborescences in time O(n
3m log(n
2/m)); the packing uses at mostm distinct arborescences. Heren andm denote the number of vertices and edges in the given graph, respectively. Similar results hold for integral packing: we pack the greatest number of arborescences in time O(min{n, logN}n
2m log(n
2/)) using at mostm + n – 2 distinct arborescences; hereN denotes the largest (integral) capacity of an edge. These resuts improve the best previous bounds for capacitated digraphs. The algorithm extends to several related problems, including packing spanning trees in an undirected capacitated graph, and covering such graphs by forests. The algorithm provides a new proof of Edmonds' theorem for arborescence packing, for both integral and real capacities, based on a laminar family of sets derived from the packing. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V. 相似文献
9.
Constantinos Daskalakis Elchanan Mossel S��bastien Roch 《Probability Theory and Related Fields》2011,149(1-2):149-189
A major task of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on a tree. Given samples from the leaves of the Markov chain, the goal is to reconstruct the leaf-labelled tree. It is well known that in order to reconstruct a tree on n leaves, sample sequences of length ??(log n) are needed. It was conjectured by Steel that for the CFN/Ising evolutionary model, if the mutation probability on all edges of the tree is less than ${p^{\ast} = (\sqrt{2}-1)/2^{3/2}}$ , then the tree can be recovered from sequences of length O(log n). The value p* is given by the transition point for the extremality of the free Gibbs measure for the Ising model on the binary tree. Steel??s conjecture was proven by the second author in the special case where the tree is ??balanced.?? The second author also proved that if all edges have mutation probability larger than p* then the length needed is n ??(1). Here we show that Steel??s conjecture holds true for general trees by giving a reconstruction algorithm that recovers the tree from O(log n)-length sequences when the mutation probabilities are discretized and less than p*. Our proof and results demonstrate that extremality of the free Gibbs measure on the infinite binary tree, which has been studied before in probability, statistical physics and computer science, determines how distinguishable are Gibbs measures on finite binary trees. 相似文献
10.
Jean‐Franois Marckert 《Random Structures and Algorithms》2004,24(2):118-132
The rotation correspondence is a map that sends the set of plane trees onto the set of binary trees. In this paper, we first show that when n goes to +∞, the image by the rotation correspondence of a uniformly chosen random plane tree τ with n nodes is close to 2τ (in a sense to be defined). The second part of the paper is devoted to the right and left depth of nodes in binary trees. We show that the empiric measure (suitably normalized) associated with the difference of the right depth and the left depth processes converges to the integrated super Brownian excursion. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
11.
Three related rectangle intersection problems in k-dimensional space are considered: (1) find the intersections of a rectangle with a given set of rectangles, (2) find the intersecting pairs of rectangles as they are inserted into or deleted from an existing set of rectangles, and (3) find the intersecting pairs of a given set of rectangles. By transforming these problems into range search problems, one need not divide the intersection problem into two subproblems, namely, the edge-intersecting problem and the containment problem, as done by many previous studies. Furthermore, this approach can also solve these subproblems separately, if required. For the first problem the running time is O((log n)2k−1 + s), where s is the number of intersecting pairs of rectangles. For the second problem the time needed to generate and maintain n rectangles is O(n(log n)2k) and the time for each query is O((log n)2k−1 + s). For the third problem the total time is O(n log n + n(log n)2(k−1) + s) for k ≥ 1. 相似文献
12.
We study the asymptotic distribution of the fill‐up level in a binary trie built over n independent strings generated by a biased memoryless source. The fill‐up level is the number of full levels in a tree. A level is full if it contains the maximum allowable number of nodes (e.g., in a binary tree level k can have up to 2k nodes). The fill‐up level finds many interesting applications, e.g., in the internet IP lookup problem and in the analysis of level compressed tries (LC tries). In this paper, we present a complete asymptotic characterization of the fill‐up distribution. In particular, we prove that this distribution concentrates on one or two points around the most probably value k = ?log1/qn ? log log log n + 1 + log log(p/q)?, where p > q = 1 ? p is the probability of generating the more likely symbol (while q = 1 ? p is the probability of the less likely symbol). We derive our results by analytic methods such as generating functions, Mellin transform, the saddle point method, and analytic depoissonization. We also present some numerical verification of our results. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
13.
Computing Vertex Connectivity: New Bounds from Old Techniques 总被引:1,自引:0,他引:1
Monika R. Henzinger Satish Rao Harold N. Gabow 《Journal of Algorithms in Cognition, Informatics and Logic》2000,34(2):222
The vertex connectivity κ of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. We present the fastest known deterministic algorithm for finding the vertex connectivity and a corresponding separator. The time for a digraph having n vertices and m edges is O(min{κ3 + n, κn}m); for an undirected graph the term m can be replaced by κn. A randomized algorithm finds κ with error probability 1/2 in time O(nm). If the vertices have nonnegative weights the weighted vertex connectivity is found in time O(κ1nmlog(n2/m)) where κ1 ≤ m/n is the unweighted vertex connectivity or in expected time O(nmlog(n2/m)) with error probability 1/2. The main algorithm combines two previous vertex connectivity algorithms and a generalization of the preflow-push algorithm of Hao and Orlin (1994, J. Algorithms17, 424–446) that computes edge connectivity. 相似文献
14.
We present an algorithm for the routing problem for two-terminal nets in generalized switchboxes. A generalized switchbox is any subset R of the planar rectangular grid with no nontrivial holes, i.e., every finite face has exactly four incident vertices. A net is a pair of nodes of nonmaximal degree on the boundary of R. A solution is a set of edge-disjoint paths, one for each net. Our algorithm solves standard generalized switchbox routing problems in time O(n(log n)2) where n is the number of vertices of R, i.e., it either finds a solution or indicates that there is none. A problem is standard if deg(ν) + ter(ν) is even for all vertices ν where deg(ν) is the degree of ν and ter(ν) is the number of nets which have ν as a terminal. For nonstandard problems we can find a solution in time O(n(log n)2 + |U|2) where U is the set of vertices ν with deg(ν) + ter(ν) is odd. 相似文献
15.
We study binary search trees constructed from Weyl sequences {nθ}, n≥1, where θ is an irrational and {·} denotes “mod 1.” We explore various properties of the structure of these trees, and relate them to the continued fraction expansion of θ. If Hn is the height of the tree with n nodes when θ is chosen at random and uniformly on [0, 1], then we show that in probability, Hn∼(12/π2)log n log log n. © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 12, 271–295, 1998 相似文献
16.
Professor Dr. Rudolf Borges 《Probability Theory and Related Fields》1970,14(3):189-199
Summary The class (1) of transformations of a binomial variablek is studied. The famous De Moivre-Laplace local and integral limit theorems are generalized for the asymptotically standardized transformations (2). The transformation (4) respectively (3) is singled out as the only one with an error of order 1/n. Besides it is shown, that the error term of ordern
–1/2 of the identical transformation, the angular transformation, and the logarithmic transformation are in proportion to 1/6, –1/12, and –1/3. Results on the influence of a correction of unbiasedness are mentioned in the last section. Such corrections allow a slight improvement of our new transformation. 相似文献
17.
Linking (n − 2)-dimensional panels inn-space II: (n − 2, 2)-frameworks and body and hinge structures
Tiong-Seng Tay 《Graphs and Combinatorics》1989,5(1):245-273
An (n – 1, 2)-framework inn-space is a structure consisting of a finite set of (n – 2)-dimensional panels and a set of rigid bars each joining a pair of panels using ball joints. A body and hinge (or (n + 1,n – 1)-) framework inn-space consists of a finite set ofn-dimensional bodies articulated by a set of (n – 2)-dimensional hinges, i.e., joints in 2-space, line hinges in 3-space, plane-hinges in 4-space, etc. In this paper we characterize the graphs of all rigid (n – 1, 2)- and (n + 1,n – 1)-frameworks inn-space. Rigidity here is statical rigidity or equivalently infinitesimal rigidity. 相似文献
18.
John Riordan 《Journal of Graph Theory》1979,3(2):127-133
Label-increasing trees are fully labeled rooted trees with the restriction that the labels are in increasing order on every path from the root; the best known example is the binary case—no tree with more than two branches at the root, or internal vertices of degree greater than three—extensively examined by Foata and Schutzenberger in A Survey of Combinatorial Theory. The forests without branching restrictions are enumerated by number of trees by Fn(x) = x(x + 1)…(x + n ? 1), n >1 (F0(x) = 1), whose equivalent: Fn(x) = Yn(xT1,…, xTn), Fn(1)= Tn + 1 = n!, is readily adapted to branching restriction. 相似文献
19.
Let {Xn} be a strictly stationary φ-mixing process with Σj=1∞ φ1/2(j) < ∞. It is shown in the paper that if X1 is uniformly distributed on the unit interval, then, for any t [0, 1], |Fn−1(t) − t + Fn(t) − t| = O(n−3/4(log log n)3/4) a.s. and sup0≤t≤1 |Fn−1(t) − t + Fn(t) − t| = (O(n−3/4(log n)1/2(log log n)1/4) a.s., where Fn and Fn−1(t) denote the sample distribution function and tth sample quantile, respectively. In case {Xn} is strong mixing with exponentially decaying mixing coefficients, it is shown that, for any t [0, 1], |Fn−1(t) − t + Fn(t) − t| = O(n−3/4(log n)1/2(log log n)3/4) a.s. and sup0≤t≤1 |Fn−1(t) − t + Fn(t) − t| = O(n−3/4(log n)(log log n)1/4) a.s. The results are further extended to general distributions, including some nonregular cases, when the underlying distribution function is not differentiable. The results for φ-mixing processes give the sharpest possible orders in view of the corresponding results of Kiefer for independent random variables. 相似文献
20.
On the Estimation of Jump Points in Smooth Curves 总被引:1,自引:1,他引:0
Irene Gijbels Peter Hall Aloïs Kneip 《Annals of the Institute of Statistical Mathematics》1999,51(2):231-251
Two-step methods are suggested for obtaining optimal performance in the problem of estimating jump points in smooth curves. The first step is based on a kernel-type diagnostic, and the second on local least-squares. In the case of a sample of size n the exact convergence rate is n
– 1, rather than n
– 1 + (for some > 0) in the context of recent one-step methods based purely on kernels, or n
– 1 (log n)1 + for recent techniques based on wavelets. Relatively mild assumptions are required of the error distribution. Under more stringent conditions the kernel-based step in our algorithm may be used by itself to produce an estimator with exact convergence rate n
– 1 (log n)1/2. Our techniques also enjoy good numerical performance, even in complex settings, and so offer a viable practical alternative to existing techniques, as well as providing theoretical optimality. 相似文献