A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time (Q2810272): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/13093618x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2401697020 / rank | |||
Normal rank | |||
Latest revision as of 11:01, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time |
scientific article |
Statements
A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time (English)
0 references
1 June 2016
0 references
graph algorithms
0 references
dynamic algorithms
0 references
transitive closure
0 references
0 references
