Some modified algorithms for Dijkstra's longest upsequence problem
From MaRDI portal
Publication:1161300
DOI10.1007/BF00625277zbMath0478.68074OpenAlexW2024244897MaRDI QIDQ1161300
Robert B. K. Dewar, Susan M. Merritt, Micha Sharir
Publication date: 1982
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00625277
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Related Items
Computing the all-pairs longest chains in the plane, An efficient algorithm for maxdominance, with applications, Finding a minimum independent dominating set in a permutation graph, An algorithm for the determination of longest increasing subsequence in a sequence
Cites Work
- Unnamed Item
- Some beautiful arguments using mathematical induction
- Some Observations Concerning Formal Differentiation of Set Theoretic Expressions
- Significant Improvements to the Hwang-Lin Merging Algorithm
- The Ford-Johnson Sorting Algorithm Is Not Optimal
- A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
