↓ Skip to main content
What is this page? Embed badge

Computing and Combinatorics

Overview of attention for book
Cover of 'Computing and Combinatorics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Algorithmic Approaches to Information Retrieval and Data Mining
  3. Altmetric Badge
    Chapter 2 Combinatorial Problems Arising in Massive Data Sets
  4. Altmetric Badge
    Chapter 3 Estimating Parameters of Monotone Boolean Functions
  5. Altmetric Badge
    Chapter 4 De-amortization of Algorithms
  6. Altmetric Badge
    Chapter 5 On Computing New Classes of Optimal Triangulations with Angular Constraints
  7. Altmetric Badge
    Chapter 6 Maximum Weight Triangulation and Its Application on Graph Drawing
  8. Altmetric Badge
    Chapter 7 The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
  9. Altmetric Badge
    Chapter 8 Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space
  10. Altmetric Badge
    Chapter 9 Parallel Geometric Algorithms in Coarse-Grain Network Models
  11. Altmetric Badge
    Chapter 10 On the Bahncard Problem
  12. Altmetric Badge
    Chapter 11 The Ultimate Strategy to Search on m Rays?
  13. Altmetric Badge
    Chapter 12 Better Approximation of Diagonal-Flip Transformation and Rotation Transformation
  14. Altmetric Badge
    Chapter 13 A Cost Optimal Parallel Algorithm for Computing Force Field in N-Body Simulations
  15. Altmetric Badge
    Chapter 14 Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT
  16. Altmetric Badge
    Chapter 15 Algorithms for Almost-Uniform Generation with an Unbiased Binary Source
  17. Altmetric Badge
    Chapter 16 Improved Algorithms for Chemical Threshold Testing Problems
  18. Altmetric Badge
    Chapter 17 Min-Max-Boundary Domain Decomposition
  19. Altmetric Badge
    Chapter 18 On Boolean Lowness and Boolean Highness
  20. Altmetric Badge
    Chapter 19 The Inherent Dimension of Bounded Counting Classes
  21. Altmetric Badge
    Chapter 20 An Exact Characterization of Symmetric Functions in q AC 0 [2]
  22. Altmetric Badge
    Chapter 21 Robust Reductions
  23. Altmetric Badge
    Chapter 22 Approaches to Effective Semi-continuity of Real Functions
  24. Altmetric Badge
    Chapter 23 On the Power of Additive Combinatorial Search Model
  25. Altmetric Badge
    Chapter 24 The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary Switch
  26. Altmetric Badge
    Chapter 25 Lower Bounds for Wide-Sense Non-blocking Clos Network
  27. Altmetric Badge
    Chapter 26 Multirate Multicast Switching Networks
  28. Altmetric Badge
    Chapter 27 Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses
  29. Altmetric Badge
    Chapter 28 Executing Divisible Jobs on a Network with a Fixed Number of Processors
  30. Altmetric Badge
    Chapter 29 On the Ádám Conjecture on Circulant Graphs
  31. Altmetric Badge
    Chapter 30 Proof of Toft’s Conjecture: Every Graph Containing No Fully Odd K 4 Is 3-Colorable
  32. Altmetric Badge
    Chapter 31 A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter
  33. Altmetric Badge
    Chapter 32 A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree
  34. Altmetric Badge
    Chapter 33 A Graph Optimization Problem in Virtual Colonoscopy
  35. Altmetric Badge
    Chapter 34 Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices
  36. Altmetric Badge
    Chapter 35 An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs
  37. Altmetric Badge
    Chapter 36 Similarity in Two-Dimensional Strings
  38. Altmetric Badge
    Chapter 37 On Multi-dimensional Hilbert Indexings
  39. Altmetric Badge
    Chapter 38 Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth
  40. Altmetric Badge
    Chapter 39 Eulerian Secret Key Exchange
  41. Altmetric Badge
    Chapter 40 One-Time Tables for Two-Party Computation
Attention for Chapter 32: A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Readers on

mendeley
2 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree
Chapter number 32
Book title
Computing and Combinatorics
Published by
Springer, Berlin, Heidelberg, August 1998
DOI 10.1007/3-540-68535-9_32
Book ISBNs
978-3-54-064824-6, 978-3-54-068535-7
Authors

Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang, Peng, Sheng-Lung, Ho, Chin-Wen, Hsu, Tsan-sheng, Ko, Ming-Tat, Tang, Chuan Yi

View on publisher site

Login to access the Attention Digest and the Sentiment Analysis related to this output.

Timeline Attention over time Attention Score history
Login to access the full charts related to this output.
Activity
Login to access the full charts related to this output.
Mendeley demographics

Mendeley demographics

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Login to view Mendeley reader trends over time.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 1 50%
Lecturer 1 50%
Readers by discipline Count As %
Mathematics 1 50%
Agricultural and Biological Sciences 1 50%