An optimal EREW PRAM algorithm for minimum spanning tree verification (Q290239): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68W10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68R10 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6588303 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
parallel algorithms | |||
Property / zbMATH Keywords: parallel algorithms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
minimum spanning tree verification | |||
Property / zbMATH Keywords: minimum spanning tree verification / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
EREW PRAM | |||
Property / zbMATH Keywords: EREW PRAM / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
design of algorithms | |||
Property / zbMATH Keywords: design of algorithms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
optimal algorithm | |||
Property / zbMATH Keywords: optimal algorithm / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3140396 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal parallel verification of minimum spanning trees in logarithmic time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3128927 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4875217 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4023519 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3798226 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A simpler minimum spanning tree verification algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear verification for spanning trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4385522 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Applications of Path Compression on Balanced Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:57, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An optimal EREW PRAM algorithm for minimum spanning tree verification |
scientific article |
Statements
An optimal EREW PRAM algorithm for minimum spanning tree verification (English)
0 references
1 June 2016
0 references
parallel algorithms
0 references
minimum spanning tree verification
0 references
EREW PRAM
0 references
design of algorithms
0 references
optimal algorithm
0 references
0 references