Improved Dynamic Reachability Algorithms for Directed Graphs (Q3532572)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5358294
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved Dynamic Reachability Algorithms for Directed Graphs |
scientific article; zbMATH DE number 5358294 |
Statements
Improved Dynamic Reachability Algorithms for Directed Graphs (English)
0 references
28 October 2008
0 references
dynamic algorithms
0 references
transitive closure
0 references
strongly connected components
0 references
0.9332860112190248
0 references
0.917138934135437
0 references
0.9161896109580994
0 references
0.8833848237991333
0 references
