Dynamic expression trees

DOI10.1007/BF01190506zbMath0816.68091MaRDI QIDQ1346771

R. F. Cohen, Roberto Tamassia

Publication date: 9 April 1995

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

binary treesseries parallel digraphsseries-parallel subgraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (2)

An \(O(n \log n)\) time algorithm for computing the path-length distance between trees ⋮ An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic maintenance of planar digraphs, with applications
• Proving relative lower bounds for incremental algorithms
• A fast algorithm for the generalized parametric minimum cut problem and applications
• A data structure for dynamic trees
• Shortest-path algorithms: Taxonomy and annotation
• Optimal orientations of cells in slicing floorplan designs
• Biased Search Trees
• The Recognition of Series Parallel Digraphs
• Linear-time computability of combinatorial problems on series-parallel graphs
• Maintenance of a minimum spanning forest in a dynamic plane graph
• On Finding and Updating Spanning Trees and Shortest Paths
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• The Parallel Evaluation of General Arithmetic Expressions
• A Fast Parametric Maximum Flow Algorithm and Applications

This page was built for publication: Dynamic expression trees