✦ LIBER ✦

Efficient algorithms and partial k-trees

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 207 KB
Volume: 54
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90017-5

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

Polynomial algorithms for graph isomorph

Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees

✍ Hans L Bodlaender 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 783 KB

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

Efficient algorithms for inferring evolu

Efficient algorithms for inferring evolutionary trees

✍ Dan Gusfield 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 547 KB

Efficient algorithms for generalized cut

Efficient algorithms for generalized cut-trees

✍ Dan Gusfield; Dalit Naor 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 872 KB

Efficient algorithms for tree reconstruc

Efficient algorithms for tree reconstruction

✍ W. Slough; K. Efe 📂 Article 📅 1989 🏛 Springer Netherlands 🌐 English ⚖ 154 KB