"In Which Graph Structures Can We Efficiently Find Temporally Disjoint ..."

Pascal Kunz, Hendrik Molter, Meirav Zehavi (2023)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2301.10503

access: open

type: Informal or Other Publication

metadata version: 2023-01-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2301-10503
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2301-10503
Pascal Kunz, Hendrik Molter, Meirav Zehavi:
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? CoRR abs/2301.10503 (2023)

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.