"Efficient Algorithms for Listing k Disjoint st-Paths in Graphs."

Roberto Grossi, Andrea Marino, Luca Versari (2018)

> Home

Details and statistics

DOI: 10.1007/978-3-319-77404-6_40

access: closed

type: Conference or Workshop Paper

metadata version: 2023-06-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/latin/GrossiMV18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/GrossiMV18
Roberto Grossi, Andrea Marino, Luca Versari:
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs. LATIN 2018: 544-557

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.