Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions & Near-Optimal Separations

Documenti analoghi

• Directed and Undirected Vertex Connectivity Problems are Equivalent for Dense Graphs
  di: Fischer, Olivier, et al.
  Pubblicazione: (2025)
• Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness
  di: Jiang, Yonggang, et al.
  Pubblicazione: (2025)
• Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth
  di: Koh, Zhuan Khye, et al.
  Pubblicazione: (2024)
• Hardness Amplification for Dynamic Binary Search Trees
  di: Jiang, Shunhua, et al.
  Pubblicazione: (2024)
• Parallel Small Vertex Connectivity in Near-Linear Work and Polylogarithmic Depth
  di: Jiang, Yonggang, et al.
  Pubblicazione: (2025)