Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth

Documenti analoghi

• Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal
  di: Chen, Daoyuan, et al.
  Pubblicazione: (2024)
• Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
  di: Ashvinkumar, Vikrant, et al.
  Pubblicazione: (2024)
• A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs
  di: Das, Debarati, et al.
  Pubblicazione: (2026)
• Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time
  di: Meierhans, Simon, et al.
  Pubblicazione: (2025)
• Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers
  di: Haeupler, Bernhard, et al.
  Pubblicazione: (2025)