✦ LIBER ✦

Some modified algorithms for Dijkstra's longest upsequence problem

✍ Scribed by Robert B. K. Dewar; Susan M. Merritt; Micha Sharir

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for the Longest Common Subseq

✍ Hirschberg, Daniel S. 📂 Article 📅 1977 🏛 Association for Computing Machinery 🌐 English ⚖ 738 KB

Analysis of Evolutionary Algorithms for

✍ Thomas Jansen; Dennis Weyland 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 429 KB

Dijkstra’s Algorithm for Solving the Sho

✍ Sathi Mukherjee 📂 Article 📅 2012 🏛 Springer Netherlands 🌐 English ⚖ 332 KB

Efficient algorithms for the longest com

✍ Tseng, Chiou-Ting; Yang, Chang-Biau; Ann, Hsing-Yen 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Proof of a modified Dijkstra's algorithm

✍ Lee, D.C. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 121 KB

[Lecture Notes in Computer Science] Algo

✍ Fleischer, Rudolf; Trippen, Gerhard 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg ⚖ 204 KB