Login / Signup

Exploiting the diversity of shortest pairs of edge-disjoint paths.

Marina GirolimettoRodrigo Stange TessinariFabio O. LimaClaunir PavanMarcia H. M. Paiva
Published in: SBRC (2018)
Keyphrases
  • disjoint paths
  • approximation algorithms
  • directed graph
  • undirected graph
  • pairwise
  • shortest path
  • neural network
  • real time
  • similarity measure
  • origin destination