What Makes the Arc-Preserving Subsequence Problem Hard?

Lecture Notes in Computer Science - Computational Science – ICCS 2005 ◽

10.1007/11428848_110 ◽

2005 ◽

pp. 860-868 ◽

Cited By ~ 4

Author(s):

Guillaume Blin ◽

Guillaume Fertin ◽

Romeo Rizzi ◽

Stéphane Vialette

Download Full-text