Dynamic expression trees

DOI10.1007/BF01190506MaRDI QIDQ1346771zbMATH OpenFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 140481
• Dynamic algorithms for shortest paths in planar graphs
• Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
• Dynamic trees in practice
• scientific article; zbMATH DE number 437542

Cites work

• scientific article; zbMATH DE number 432746 (Why is no real title available?)
• scientific article; zbMATH DE number 432748 (Why is no real title available?)
• scientific article; zbMATH DE number 432757 (Why is no real title available?)
• scientific article; zbMATH DE number 4204092 (Why is no real title available?)
• scientific article; zbMATH DE number 3900809 (Why is no real title available?)
• scientific article; zbMATH DE number 3907787 (Why is no real title available?)
• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 140481 (Why is no real title available?)
• scientific article; zbMATH DE number 1142306 (Why is no real title available?)
• A Fast Parametric Maximum Flow Algorithm and Applications
• A data structure for dynamic trees
• A fast algorithm for the generalized parametric minimum cut problem and applications
• Biased Search Trees
• Dynamic maintenance of planar digraphs, with applications
• 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
• Optimal orientations of cells in slicing floorplan designs
• Proving relative lower bounds for incremental algorithms
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Shortest-path algorithms: Taxonomy and annotation
• The Parallel Evaluation of General Arithmetic Expressions
• The Recognition of Series Parallel Digraphs

Cited in

(3)

• An O(n n) time algorithm for computing the path-length distance between trees
• An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
• scientific article; zbMATH DE number 140481 (Why is no real title available?)

This page was built for publication: Dynamic expression trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1346771)