Login / Signup

Faster Graph Algorithms Through DAG Compression.

Max BannachFlorian Andreas MarwitzTill Tantau
Published in: STACS (2024)
Keyphrases
  • directed acyclic graph
  • data structure
  • computational complexity
  • learning algorithm
  • optimization problems
  • computational cost
  • times faster
  • directed graph
  • data compression
  • random walk
  • web graph