Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 229,805,765 papers from all fields of science
Search
Sign In
Create Free Account
Tree traversal
Known as:
Inorder walk
, Converse Postorder
, Pre-order traversal
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
AlphaGo
Ancestral reconstruction
And–or tree
Array data structure
Expand
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. A
,
A. 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…
Expand
Highly Cited
2012
Highly Cited
2012
Design and management of flexible process variants using templates and rules
Akhil Kumar
,
W. Yao
Computers in industry (Print)
2012
Corpus ID: 18716364
Review
2011
Review
2011
A Survey on Geographic Routing Protocols for Mobile Ad hoc Networks
A. Maghsoudlou
,
M. St-Hilaire
,
T. Kunz
2011
Corpus ID: 61172342
Geographic routing has become one of the most suitable routing strategies in wireless mobile ad hoc network mainly due to its…
Expand
Highly Cited
2010
Highly Cited
2010
Quasi-worlds and quasi-operators on quasi-triangulations
Deok-Soo Kim
,
Youngsong Cho
,
K. Sugihara
Comput. Aided Des.
2010
Corpus ID: 28168259
Highly Cited
2000
Highly Cited
2000
Sensor Optimization for Fault Diagnosis in Multi-Fixture Assembly Systems With Distributed Sensing
A. Khan
,
D. Ceglarek
2000
Corpus ID: 3042719
Sensing for the system-wide diagnosis of dimensional faults in multi-fixture sheet metal assembly presents significant issues of…
Expand
Highly Cited
2000
Highly Cited
2000
IGRAINE-an Implication GRaph-bAsed engINE for fast implication, justification, and propagation
P. Tafertshofer
,
A. Ganz
,
K. Antreich
IEEE Trans. Comput. Aided Des. Integr. Circuits…
2000
Corpus ID: 5548644
Implication, justification, and propagation are three important Boolean problems that have to be solved during many tasks in…
Expand
1995
1995
Computing the area versus delay trade-off curves in technology mapping
K. Chaudhary
,
Massoud Pedram
IEEE Trans. Comput. Aided Des. Integr. Circuits…
1995
Corpus ID: 6849688
We examine the problem of mapping a Boolean network using gates from a finite size cell library. The objective is to minimize the…
Expand
1992
1992
Generating Netlists from Executable Circuit Specifications
J. O'Donnell
Functional Programming
1992
Corpus ID: 8652401
A semiconductor wafer is provided with a plurality of semiconductor pellets arranged in rows and columns in a checkered pattern…
Expand
1991
1991
Optimization of Nonrecursive Queries in OODBs
Rosana S. G. Lanzelotte
,
P. Valduriez
,
M. Ziane
,
J. Cheiney
International Conference on Deductive and Object…
1991
Corpus ID: 37060005
An important problem of OODB query optimization is to perform efficiently path traversals expressed in queries involving complex…
Expand
Highly Cited
1974
Highly Cited
1974
Allocating Storage for Extendible Arrays
A. Rosenberg
JACM
1974
Corpus ID: 13070917
Arrays are among the best understood and most widely used data structures. Yet even now, there are no satisfactory techniques for…
Expand
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)
ACCEPT & CONTINUE