Anytime Algorithms for the Longest Common Palindromic Subsequence Problem

Marko Djukanovic, Günther Raidl, Christian Blum
January 2018
PDF Cite
Type
Technical Report
Günther Raidl
Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.