In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Pascal Kunz; Hendrik Molter; Meirav Zehavi

Journal title: Crossref

Journal number: 1

Journal publisher: International Joint Conferences on Artificial Intelligence Organization

Published year: 2023

DOI identifier: 10.24963/ijcai.2023/21