"What Makes the Arc-Preserving Subsequence Problem Hard?"

Guillaume Blin et al. (2005)

> Home

Details and statistics

DOI: 10.1007/11428848_110

access: open

type: Conference or Workshop Paper

metadata version: 2018-06-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/iccS/BlinFRV05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccS/BlinFRV05
Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
What Makes the Arc-Preserving Subsequence Problem Hard? International Conference on Computational Science (2) 2005: 860-868

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.