類似資料

• Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs
  著者:: Bernstein, Aaron, 等
  出版事項: (2025)
• Efficient Matroid Intersection via a Batch-Update Auction Algorithm
  著者:: Blikstad, Joakim, 等
  出版事項: (2024)
• Deterministic Dynamic Maximal Matching in Sublinear Update Time
  著者:: Bernstein, Aaron, 等
  出版事項: (2025)
• Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
  著者:: Ashvinkumar, Vikrant, 等
  出版事項: (2026)
• Decremental $(1+ε)$-Approximate Maximum Eigenvector: Dynamic Power Method
  著者:: Adil, Deeksha, 等
  出版事項: (2024)