Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
AlphaGoAncestral reconstructionAnd–or treeArray data structure

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Hierarchical cost effective leach for heterogeneous wireless sensor networks
  • R. AA. H
  • International Conference on Advanced Computing…
  • 2015
  • Corpus ID: 15492374
Wireless sensor networks are those that are used for the communication between various sensor nodes to the base station… 
2015
2015
Local region detector + CNN based landmarks for practical place recognition in changing environments
Visual place recognition is a mature field in mobile robotics research. Recognizing places in datasets covering traversals of… 
2015
2015
Columnar objects: improving the performance of analytical applications
Growing volumes of data increase the demand to use it in analytical applications to make informed decisions. Unfortunately… 
2010
2010
Progressive clustering of networks using Structure-Connected Order of Traversal
Network clustering enables us to view a complex network at the macro level, by grouping its nodes into units whose… 
2006
2006
Unbiased MMSE Tree Search Detection for Multiple Antenna Systems
Tree search based detection techniques allow to achieve near-capacity performance in iterative receivers for multiple antenna… 
2002
2002
Fast and Simple Occlusion Culling Using Hardware-based Depth Queries
: We present a conservative occlusion culling algorithm for large environments. As part of a preprocess, we decompose the scene… 
1995
1995
Computing the area versus delay trade-off curves in technology mapping
We examine the problem of mapping a Boolean network using gates from a finite size cell library. The objective is to minimize the… 
1993
1993
Database and display algorithms for interactive visualization of architectural models
This thesis describes a system for interactive walkthroughs of large, fully furnished architectural models. Realistic-looking… 
1990
1990
Formal Boolean manipulations for the verification of sequential machines
The paper addresses the problem of verifying synchronous sequential machines. It first shows that there is a certain class of… 
Highly Cited
1987
Highly Cited
1987
Robot path planning using intersecting convex shapes: Analysis and simulation
An automated path planning algorithm for a mobile robot in a structured environment is presented. An algorithm based on the Quine… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)