Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components
From MaRDI portal
Publication:2933657
DOI10.1145/2483699.2483707zbMath1301.05336OpenAlexW2035767178MaRDI QIDQ2933657
Publication date: 5 December 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2483699.2483707
graph algorithmstransitive closuredynamic algorithmsstrongly connected componentsdecremental algorithms
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Connectivity (05C40)
Related Items
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture, Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs, Accelerating the calculation of makespan used in scheduling improvement heuristics, Tight Localizations of Feedback Sets, Decremental SPQR-trees for Planar Graphs, Where is this leading me: stationary point and equilibrium analysis for self-modeling network models, Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time