๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Efficient algorithms and partial k-trees


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
207 KB
Volume
54
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Efficient sets in partial k-trees
โœ Jan Arne Telle; Andrzej Proskurowski ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 652 KB
Rectilinear steiner trees: Efficient spe
โœ 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