A fully dynamic reachability algorithm for directed graphs with an almost linear update time (Q2810272)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time |
scientific article; zbMATH DE number 6588078
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully dynamic reachability algorithm for directed graphs with an almost linear update time |
scientific article; zbMATH DE number 6588078 |
Statements
1 June 2016
0 references
graph algorithms
0 references
dynamic algorithms
0 references
transitive closure
0 references
0 references
A fully dynamic reachability algorithm for directed graphs with an almost linear update time (English)
0 references