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

Kunz et al. "In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?." International Joint Conference on Artificial Intelligence, 2023. doi:10.24963/IJCAI.2023/21

[Kunz et al. "In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?." International Joint Conference on Artificial Intelligence, 2023.](https://mlanthology.org/ijcai/2023/kunz2023ijcai-graph/) doi:10.24963/IJCAI.2023/21

@inproceedings{kunz2023ijcai-graph,
  title     = {{In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?}},
  author    = {Kunz, Pascal and Molter, Hendrik and Zehavi, Meirav},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2023},
  pages     = {180-188},
  doi       = {10.24963/IJCAI.2023/21},
  url       = {https://mlanthology.org/ijcai/2023/kunz2023ijcai-graph/}
}