Computing the all-pairs longest chains in the plane

DOI10.1007/3-540-57155-8_229zbMath1504.68247OpenAlexW1583932855MaRDI QIDQ5060093

Danny Z. Chen, Mikhail J. Atallah

Publication date: 18 January 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57155-8_229

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Some beautiful arguments using mathematical induction
• Some modified algorithms for Dijkstra's longest upsequence problem
• New clique and independent set algorithms for circle graphs
• Parallel rectilinear shortest paths with rectangular obstacles
• On computing the length of longest increasing subsequences
• Efficient Parallel Algorithms for String Editing and Related Problems
• Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
• An Efficient Parallel Biconnectivity Algorithm
• Finding maximum cliques in circle graphs
• Efficient algorithms for interval graphs and circular-arc graphs
• Algorithms on circular-arc graphs
• The Parallel Evaluation of General Arithmetic Expressions
• Transitive Orientation of Graphs and Identification of Permutation Graphs
• Permutation Graphs and Transitive Graphs
• Algorithms for a maximum clique and a maximum independent set of a circle graph

This page was built for publication: Computing the all-pairs longest chains in the plane