Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers

Documenti analoghi

• Reducing Shortcut and Hopset Constructions to Shallow Graphs
  di: Haeupler, Bernhard, et al.
  Pubblicazione: (2025)
• DAG Projections: Reducing Distance and Flow Problems to DAGs
  di: Haeupler, Bernhard, et al.
  Pubblicazione: (2026)
• Dynamic Deterministic Constant-Approximate Distance Oracles with $n^ε$ Worst-Case Update Time
  di: Haeupler, Bernhard, et al.
  Pubblicazione: (2024)
• A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Paths
  di: Fischer, Nick, et al.
  Pubblicazione: (2024)
• Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching
  di: Bucić, Matija, et al.
  Pubblicazione: (2025)