Efficient implementation of the Italiano algorithms for updating the transitive closure on associative parallel processors (Q3601405)
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 5506098
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient implementation of the Italiano algorithms for updating the transitive closure on associative parallel processors |
scientific article; zbMATH DE number 5506098 |
Statements
10 February 2009
0 references
directed graph
0 references
spanning tree
0 references
adjacency matrix
0 references
transitive closure of a directed graph
0 references
incremental algorithm
0 references
decremental algorithm
0 references
associative parallel processor
0 references
access data by contents
0 references
0.9295739531517028
0 references
0.7736616730690002
0 references
0.7695518136024475
0 references
