Improved deterministic algorithms for decremental reachability and strongly connected components
From MaRDI portal
Publication:2933657
Recommendations
- scientific article; zbMATH DE number 6783482
- Decremental strongly connected components and single-source reachability in near-linear time
- Decremental strongly-connected components and single-source reachability in near-linear time
- Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
- Decremental single-source reachability in planar digraphs
Cited in
(9)- Accelerating the calculation of makespan used in scheduling improvement heuristics
- Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
- Decremental strongly-connected components and single-source reachability in near-linear time
- Decremental SPQR-trees for Planar Graphs
- scientific article; zbMATH DE number 6783482 (Why is no real title available?)
- Tight localizations of feedback sets
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
- Decremental strongly connected components and single-source reachability in near-linear time
- Where is this leading me: stationary point and equilibrium analysis for self-modeling network models
This page was built for publication: Improved deterministic algorithms for decremental reachability and strongly connected components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933657)