Dynamic expression trees

DOI10.1007/BF01190506zbMATH Open0816.68091MaRDI QIDQ1346771FDOQ1346771

Authors: R. F. Cohen, Roberto Tamassia 

Publication date: 9 April 1995

Published in: Algorithmica (Search for Journal in Brave)

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

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)

Cites Work

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

Cited In (3)

• 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
• Title not available (Why is that?)

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)