Similar Items: Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
- Designing Capacitated Subnetworks for Shortest Path Routing
- Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem
- Faster Algorithms for Shortest Unique or Absent Substrings
- Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
- Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs
- Nearly Optimal Attention Coresets