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

Summary

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 and Meirav Zehavi

Journal title: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, {IJCAI} 2023

Journal publisher: ijcai.org

Published year: 2023

DOI identifier: 10.24963/ijcai.2023/21