"Finding Optimal Longest Paths by Dynamic Programming in Parallel."

Kai Fieger et al. (2019)

> Home

Details and statistics

DOI: 10.1609/SOCS.V10I1.18503

access: open

type: Conference or Workshop Paper

metadata version: 2024-08-13

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/socs/FiegerB0S19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/socs/FiegerB0S19
Kai Fieger, Tomás Balyo, Christian Schulz, Dominik Schreiber:
Finding Optimal Longest Paths by Dynamic Programming in Parallel. SOCS 2019: 61-69

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.