COMPUTING THE ALL-PAIRS LONGEST CHAINS IN THE PLANE

DOI10.1142/S0218195995000155MaRDI QIDQ4848832zbMATH OpenOpenAlexFDO

Authors Danny Z. Chen, Mikhail J. Atallah

Publication date 18 March 1996

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195995000155

zbMATH Keywords

CREW PRAM modelspace complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05) Parallel algorithms in computer science (68W10)

Recommendations

• Computing the all-pairs longest chains in the plane
• An Optimal Algorithm for the Maximum Two-Chain Problem
• Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
• Geometric applications of a matrix-searching algorithm
• Efficient Matrix Chain Ordering in Polylog Time

Cited in

(3)

• An Optimal Algorithm for the Maximum Two-Chain Problem
• Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
• Computing the all-pairs longest chains in the plane

This page was built for publication: COMPUTING THE ALL-PAIRS LONGEST CHAINS IN THE PLANE

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