Efficient update of tree paths on associative systems with bit-parallel processing (Q2880590)
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: Efficient update of tree paths on associative systems with bit-parallel processing |
scientific article; zbMATH DE number 6024051
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient update of tree paths on associative systems with bit-parallel processing |
scientific article; zbMATH DE number 6024051 |
Statements
13 April 2012
0 references
undirected graph
0 references
minimum spanning tree
0 references
end-point
0 references
Efficient update of tree paths on associative systems with bit-parallel processing (English)
0 references
