A faster and simpler fully dynamic transitive closure (Q4962698)
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 faster and simpler fully dynamic transitive closure |
scientific article; zbMATH DE number 6972856
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster and simpler fully dynamic transitive closure |
scientific article; zbMATH DE number 6972856 |
Statements
A faster and simpler fully dynamic transitive closure (English)
0 references
5 November 2018
0 references
dynamic graph algorithms
0 references
directed graph
0 references
reachability
0 references
0.9720531
0 references
0.9259343
0 references
0.90885794
0 references
0.90885794
0 references
0.90492374
0 references
0.90015614
0 references
0.89195454
0 references
0.8786482
0 references
