Titlebook: Algorithms - ESA ‘98; 6th Annual European Gianfranco Bilardi,Giuseppe F. Italiano,Geppino Pu Conference proceedings 1998 Springer-Verlag B

尖牙

GROSS

逗留

Computing the Edit-Distance Between Unrooted Ordered Trees two ordered trees. The . between . and . is the minimum cost of a sequence of operations (contract an edge, uncontract an edge, modify the label of an edge) needed to transform . into .. We give an .(.. log .) algorithm to compute the edit distance between two ordered trees.

MAPLE

A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numberscides whether . = 0. The algorithms has a one-sided error. If . = 0, then the algorithm will give the correct answer. If . ≠ 0, then the error probability can be made arbitrarily small. The algorithm has been implemented and is expected to be practical.

frenzy

A Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract)s in the plane, under the .. metric. Our algorithms are asymptotically optimal, and use only double precision arithmetic. As a side effect of our results, we solve a question left open by Katajainen [.] about the computation of relative neighborhood graphs.

貪婪的人

A Fast Random Greedy Algorithm for the Component Commonality Problemlk, that starts from a given initial solution and accepts only better points during the walk. We use a new type of analysis, that is not based on conductance, but makes use of structural geometric properties of the problem, namely the smoothness of the set of feasible points.

amygdala

https://doi.org/10.1007/978-3-658-32840-5rrays are used and no numeric assumptions are made on the keys. The novelty of the data structure is that items are moved together in groups, in a data-structuring equivalent of “car pooling.” The main application of the data structure is a faster deterministic algorithm for minimum spanning trees.

間諜活動

鋪子

得體