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

Pascal Kunz, Hendrik Molter, Meirav Zehavi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Fingerprint

Dive into the research topics of 'In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?'. Together they form a unique fingerprint.

Engineering & Materials Science