Graph Problems on a Mesh-Connected Processor Array (Q3766876)
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: Graph Problems on a Mesh-Connected Processor Array |
scientific article; zbMATH DE number 4024814
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph Problems on a Mesh-Connected Processor Array |
scientific article; zbMATH DE number 4024814 |
Statements
Graph Problems on a Mesh-Connected Processor Array (English)
0 references
1984
0 references
adjacency matrix
0 references
breadth-first search
0 references
graph algorithms
0 references
parallel computations
0 references
graph problems
0 references
n\(\times n\) array of processors
0 references
bridges
0 references
articulation points
0 references
length of a shortest cycle
0 references
minimum spanning tree
0 references
0.90573853
0 references
0.9021808
0 references
0 references
0 references
0.8928238
0 references
