✦ LIBER ✦

Ray representation for k-trees

✍ Scribed by Varol Akman; Wm.Randolph Franklin

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 457 KB
Volume: 10
Category: Article
ISSN: 0167-8655
DOI: 10.1016/0167-8655(89)90034-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polygonal representation by edge k-d tre

Polygonal representation by edge k-d trees

✍ Lavakusha; Arun K. Pujari; P.G. Reddy 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 227 KB

Labeling Schemes for Tree Representation

✍ Reuven Cohen; Pierre Fraigniaud; David Ilcinkas; Amos Korman; David Peleg 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 358 KB

Representation of ordered trees

✍ A. V. Anisimov; I. V. Karpenko; V. V. Krizhanovskii 📂 Article 📅 1981 🏛 Springer US 🌐 English ⚖ 623 KB

Tree-decompositions, tree-representabili

Tree-decompositions, tree-representability and chordal graphs

✍ Reinhard Diestel 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 427 KB

The following assertions are shown to be equivalent, for any countable graph G: (1) G can be represented as the intersection graph of a family of subtrees of a tree; (2) G admits a tree-decomposition (Robertson/Seymour) into primes; (3) G is chordal, and G admits a simpkial tree-decomposition (Halin

The representation of permutations by tr

The representation of permutations by trees

✍ P. Bhattacharya 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 361 KB

Representation of permutations and combinations of N elements in lexicographical order by elements of a tree are considered. An algorithm for generating the nodes is presented and some examples are given. The algorithm could be implemented in any programming language that allows for recursive calls.

Enumerating k-trees

✍ Dominique Foata 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 256 KB

AMUacL k functtonal dicf~mition of rooted k-trees is given, enabling k-trees with n labeled points m be enumerated without any calculation.