Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time

Documenti analoghi

• On 2-strong connectivity orientations of mixed graphs and related problems
  di: Georgiadis, Loukas, et al.
  Pubblicazione: (2023)
• An Optimal $3$-Fault-Tolerant Connectivity Oracle
  di: Kosinas, Evangelos
  Pubblicazione: (2025)
• Faster algorithms for k-Orthogonal Vectors in low dimension
  di: Dürr, Anita, et al.
  Pubblicazione: (2025)
• Connectivity Oracles for Predictable Vertex Failures
  di: Hu, Bingbing, et al.
  Pubblicazione: (2023)
• Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More
  di: Korhonen, Tuukka
  Pubblicazione: (2024)