Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time (Q5020731)
From MaRDI portal
scientific article; zbMATH DE number 7453418
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time |
scientific article; zbMATH DE number 7453418 |
Statements
Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time (English)
0 references
7 January 2022
0 references
dynamic graph algorithms
0 references
data structures
0 references
strongly connected components
0 references
single-source reachability
0 references
reachability
0 references
ES-tree
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
