✦ LIBER ✦

Convex Realizations of Planar Linear Trees

✍ Scribed by N. S. Gusev

Book ID: 111538283
Publisher: SP MAIK Nauka/Interperiodica
Year: 2003
Tongue: English
Weight: 166 KB
Volume: 73
Category: Article
ISSN: 0001-4346
DOI: 10.1023/a:1024004503501

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convex tree realizations of partitions

✍ Andreas Dress; Michael Steel 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 326 KB

On Minimal Tree Realizations of Linear C

On Minimal Tree Realizations of Linear Codes

✍ Kashyap, N. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 486 KB

Convex hull realizations of the multipli

Convex hull realizations of the multiplihedra

✍ Stefan Forcey 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 474 KB

Convex labelings of trees

✍ Stephen J. Dow; Douglas F. Rall; Peter J. Slater 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 456 KB

A convex labeling of a tree T o f order n is a one-to-one function f from the vertex set of Tinto the nonnegative integers, so that f ( y ) 5 ( f ( x ) t f(z))/2 for every path x, y, z of length 2 in T. If, in addition, f (v) I n -1 for every vertex v of T, then f is a perfect convex labeling and T

Trees related to realizations of distanc

✍ Sacha C. Varone 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 600 KB

Linear decision trees are too weak for c

Linear decision trees are too weak for convex hull problem

✍ Jerzy W. Jaromczyk 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 515 KB