Login / Signup

All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error.

Timothy M. Chan
Published in: ESA (2021)
Keyphrases
  • undirected graph
  • directed graph
  • approximation algorithms
  • directed acyclic graph
  • shortest path
  • spanning tree
  • vertex set
  • additive error
  • data mining
  • social networks
  • probabilistic model
  • response time
  • complex networks