✦ LIBER ✦

A Topological Characterization of End Sets of a Twinning of a Tree

✍ Scribed by Curtis D. Bennett

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 112 KB
Volume: 22
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.2000.0436

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Characterization of Topology: A Comp

The Characterization of Topology: A Comparison of Four topological Indices for Rooted Binary Trees

✍ G.M. Berntson 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 388 KB

The quantification of the topological features of binary trees has been applied in several branches of biology, from botany to neurobiology to animal behaviour. The methods available for quantifying tree topology differ, both in how they are applied and how they relate to one another. In this paper,

A Rank 2 Characterization of Twinnings

✍ B. Mühlherr 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 173 KB

We give a local criterion for a relation between the chambers of two buildings to be the opposition relation of a twinning of the buildings in question.

A characterization of (γ, i)-trees

✍ E. J. Cockayne; O. Favaron; C. M. Mynhardt; J. Puech 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 170 KB

On a characterization of flow-invariant

On a characterization of flow-invariant sets

✍ Haim Brezis 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 1 views

Characterization of a Branch of the Phyl

Characterization of a Branch of the Phylogenetic Tree

✍ STUART A. SAMUEL; GEZHI WENG 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 287 KB

We use a combination of analytic models and computer simulations to gain insight into the dynamics of evolution. Our results suggest that certain interesting phenomena should eventually emerge from the fossil record. For example, there should be a "tortoise and hare effect": those genera with the sm

A Tree Projection Algorithm for Generati

A Tree Projection Algorithm for Generation of Frequent Item Sets

✍ Ramesh C. Agarwal; Charu C. Aggarwal; V.V.V. Prasad 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 355 KB

In this paper we propose algorithms for generation of frequent item sets by successive construction of the nodes of a lexicographic tree of item sets. We discuss different strategies in generation and traversal of the lexicographic tree such as breadth-first search, depth-first search, or a combinat