✦ LIBER ✦

A characterization of -minimal trees and other attainable classes

✍ Scribed by Elizabeth Jonck; Johannes H. Hattingh; Charl J. Ras

Book ID: 108114038
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 753 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.05.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A class of full Steiner minimal trees

✍ F.K. Hwang; Jia Feng Weng; Ding Zhu Du 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 559 KB

Steiner minimal tree for a given set of points in the plane is a tree which interconnects these points using Eines of shortest possible total length. We construct an infinite class of trees which are the unique full Steiner minimal trees for their sets of endpoints (vertices of degree one).

Steiner minimal trees for a class of zig

Steiner minimal trees for a class of zigzag lines

✍ R. S. Booth; J. F. Weng 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 575 KB

ISA [k] trees: A class of binary search

ISA [k] trees: A class of binary search trees with minimal or near minimal internal path length

✍ Faris N. Abuali; Roger L. Wainwright 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 786 KB

The class Steiner minimal tree problem:

The class Steiner minimal tree problem: a lower bound and test problem generation

✍ Boting Yang; Paul Gillard 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 131 KB

A forbidden minor characterization and r

A forbidden minor characterization and reliability of a class of partial 4-trees

✍ Gerard T. Lingner; Themistocles Politof; A. Satyanarayana 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 801 KB

An algorithm to find minimal cuts of coh

An algorithm to find minimal cuts of coherent fault-trees with event-classes, using a decision tree

✍ Carrasco, J.A.; Sune, V. 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 956 KB