Decremental maintenance of strongly connected components
From MaRDI portal
Publication:5741791
DOI10.1137/1.9781611973105.82zbMath1422.68196OpenAlexW4231289837MaRDI QIDQ5741791
Publication date: 15 May 2019
Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973105.82
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Connectivity (05C40)
Related Items (3)
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture ⋮ Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs ⋮ An efficient strongly connected components algorithm in the fault tolerant model
This page was built for publication: Decremental maintenance of strongly connected components