✦ LIBER ✦

The tree representation of ∑n + 1

✍ Scribed by Alan Robinson; Sarah Whitehouse

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 584 KB
Volume: 111
Category: Article
ISSN: 0022-4049
DOI: 10.1016/0022-4049(95)00116-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the tree representation of chordal gr

On the tree representation of chordal graphs

✍ Yukio Shibata 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 344 KB 👁 1 views

Tree representations of ternary relation

Tree representations of ternary relations

✍ D. Defays 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 703 KB

A new representation of binary search tr

A new representation of binary search trees

✍ Si-Qing Zheng 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 462 KB

Linear algorithms on recursive represent

Linear algorithms on recursive representations of trees

✍ S.L. Mitchell; E.J. Cockayne; S.T. Hedetniemi 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 623 KB

Tree Representations of Non-symmetric Gr

Tree Representations of Non-symmetric Group-Valued Proximities

✍ Charles Semple; Mike Steel 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 158 KB

Let X be a finite set and let d be a function from X = X into an arbitrary group G G. An example of such a function arises by taking a tree T whose vertices Ž include X, assigning two elements of G G to each edge of T one for each . Ž . orientation of the edge , and setting d i, j equal to the produ

Internal path length of the binary repre

Internal path length of the binary representation of heap-ordered trees

✍ Wen-Chin Chen; Wen-Chun Ni 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 245 KB