Login / Signup

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

Pascal KunzHendrik MolterMeirav Zehavi
Published in: IJCAI (2023)
Keyphrases
  • graph structures
  • disjoint paths
  • directed graph
  • graph structure
  • undirected graph
  • structured data
  • approximation algorithms
  • graph mining
  • multi dimensional
  • graph data
  • graph clustering
  • np hard
  • application domains