Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Tree traversal

Known as: Inorder walk, Converse Postorder, Pre-order traversal 
In computer science, tree traversal (also known as tree search) is a form of graph traversal and refers to the process of visiting (checking and/or… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
We propose a new algorithm for computing authentication paths in the Merkle signature scheme. Compared to the best algorithm for… Expand
  • figure 1
  • figure 2
  • table 2
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Significant advances have been achieved for realtime ray tracing recently, but realtime performance for complex scenes still… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present a technique for Merkle tree traversal which requires only logarithmic space and time. For a tree with N leaves, our… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In k-means clustering, we are given a set of n data points in d-dimensional space R/sup d/ and an integer k and the problem is to… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
For 2D or 3D meshes that represent the domain of continuous function to the reals, the contours|or isosurfaces|of a speci ed… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1989
Highly Cited
1989
  • G. Jacobson
  • 30th Annual Symposium on Foundations of Computer…
  • 1989
  • Corpus ID: 6867226
Data structures that represent static unlabeled trees and planar graphs are developed. The structures are more space efficient… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
A fast and simple voxel traversal algorithm through a 3D space partition is introduced. Going from one voxel to its neighbour… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1987
Highly Cited
1987
systems that are informationally equivalent and that can be characterized as sentential or diagrammatic. Sentential… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
  • R. Korf
  • Artif. Intell.
  • 1985
  • Corpus ID: 10956233
Abstract The complexities of various search algorithms are considered in terms of time, space, and cost of solution path. It is… Expand
  • figure 2
  • table 1
Is this relevant?
Highly Cited
1976
Highly Cited
1976
In the past, picture segmentation has been performed by merging small primitive regions or by recursively splitting the whole… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 8
Is this relevant?