𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient algorithms for generalized cut-trees

✍ Scribed by Dan Gusfield; Dalit Naor

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
872 KB
Volume
21
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Cut Tree Algorithms: An Experimental Stu
Cut Tree Algorithms: An Experimental Study
✍ Andrew V Goldberg; Kostas Tsioutsiouliklis πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 654 KB

This is an experimental study of algorithms for the cut tree problem. We study the Gomory-Hu and Gusfield algorithms as well as heuristics aimed to make the former algorithm faster. We develop an efficient implementation of the Gomory-Hu algorithm. We also develop problem families for testing cut tr

More Efficient Algorithm for Ordered Tre
More Efficient Algorithm for Ordered Tree Inclusion
✍ Weimin Chen πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 221 KB

Given two ordered trees S S and T T, the tree inclusion problem is to determine whether it is possible to obtain S S from T T by deleting nodes. Recently, this problem has been recognized as an important primitive in query processing for Ε½< Ε½ .< < <. structured text databases. In this paper we prese

Rectilinear steiner trees: Efficient spe
Rectilinear steiner trees: Efficient special-case algorithms
✍ A. V. Aho; M. R. Garey; F. K. Hwang πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 886 KB

## Abstract A minimal rectilinear Steiner tree for a set A of points in the plane is a tree which interconnects A using horizontal and vertical lines of shortest possible total length. Such trees have potential application to wire layout for printed circuits. Unfortunately, at present no practical