Tree (data structure)

Known as: Sibling node, Tree leaf, Root Node

In computer science, a tree is a widely used abstract data type (ADT)—or data structure implementing this ADT—that simulates a hierarchical tree…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2010

To facilitate XML query processing, several labeling schemes have been proposed, in which the ancestor-descendant and parent…

2007

Scalability is a great concern in the design of multicast routing protocols for the global Internet. Building shortest path trees…

2007

The paper proposes an efficient indexing scheme for binary feature template using B+ tree. In this scheme the input image is…

2006

This paper presents an automated approach to learning object models by means of useful object data extracted from data-intensive…

2005

We apply a new visualization for complex heirarchies, CropCircles, to the interactive visualization of Web Ontologies and E…

1999

A key obstacle to the widespread use of distributed object oriented systems is the lack of scalable access control mechanisms. It…

1995

Three-layer feed-forward neural networks for the prediction of I3C NMR chemical shifts of alkanes through nine carbon atoms are…

1994

Formulas for the hyper-Wiener index of chains and trees which contain one trivalent or tetravalent branching vertex are derived…

1989

Concepts of coverage are extended to a problem of network design. Maximal covering tree problems are introduced to widen the…

1960

Loblolly pine (P. t'asda L.), a species of high commercial value, has a wide geographic range and grows under many different site…