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.

2007

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

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…

2002

Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender…

1999

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

1989

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

1986

1978

A syntactic model for the computer generation of textures is proposed. A texture pattern is composed of fixed-sized windows as…

1960

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

Highly Cited

1940

Highly Cited

1940