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

Pascal Kunz, Hendrik Molter, Meirav Zehavi (2023)

> Home

Details and statistics

DOI: 10.24963/IJCAI.2023/21

access: open

type: Conference or Workshop Paper

metadata version: 2025-10-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/ijcai/KunzMZ23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcai/KunzMZ23
Pascal Kunz, Hendrik Molter, Meirav Zehavi:
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? IJCAI 2023: 180-188

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.