Login / Signup

On graphs coverable by k shortest paths.

Maël DumasFlorent FoucaudAnthony PerezIoan Todinca
Published in: CoRR (2022)
Keyphrases
  • graph matching
  • graph theoretic
  • series parallel
  • website
  • search algorithm
  • directed graph
  • graph classification
  • data sets
  • data mining
  • objective function
  • bipartite graph
  • graph model
  • graph clustering