Efficient graph-theoretic algorithms on a linear array with a reconfigurable pipelined bus system (Q698145)
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 graph-theoretic algorithms on a linear array with a reconfigurable pipelined bus system |
scientific article; zbMATH DE number 1802421
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient graph-theoretic algorithms on a linear array with a reconfigurable pipelined bus system |
scientific article; zbMATH DE number 1802421 |
Statements
Efficient graph-theoretic algorithms on a linear array with a reconfigurable pipelined bus system (English)
0 references
18 September 2002
0 references
parallel algorithm
0 references
optical computing
0 references
reconfigurable pipelined bus
0 references
graph algorithms
0 references
connected components,minimum spanning forest
0 references
biconnected components
0 references
0.8127641677856445
0 references
0.801142692565918
0 references
0.7936394810676575
0 references
