Searching for "What Makes the Arc-Preserving Subsequence Problem Hard?" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

What makes the arc-preserving subsequence problem hard
by Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette — 2005 — In Proc. 5th International Conference on Computational Science (ICCS), volume 3515 of LNCS
…What makes the Arc-Preserving Subsequence problem hard? ⋆ Guillaume Blin 1 , Guillaume Fertin 1…
Cited by 5 (2 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB