![Operations research / NP-complete problems / Dynamic programming / Equations / Systems engineering / Shortest path problem / Longest common subsequence problem / Graph / Catalan number / Mathematics / Theoretical computer science / Graph theory Operations research / NP-complete problems / Dynamic programming / Equations / Systems engineering / Shortest path problem / Longest common subsequence problem / Graph / Catalan number / Mathematics / Theoretical computer science / Graph theory](https://www.pdfsearch.io/img/841a445551705d5757248a6f2fab8e31.jpg) Date: 2007-02-16 03:04:45Operations research NP-complete problems Dynamic programming Equations Systems engineering Shortest path problem Longest common subsequence problem Graph Catalan number Mathematics Theoretical computer science Graph theory | | An O(ND) Difference Algorithm and Its Variations∗ EUGENE W. MYERS Department of Computer Science, University of Arizona, Tucson, AZ 85721, U.S.A. ABSTRACTAdd to Reading ListSource URL: xmailserver.orgDownload Document from Source Website File Size: 81,22 KBShare Document on Facebook
|