Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees (Q1098631): 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 / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(88)90084-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2065634943 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Deterministic coin tossing with applications to optimal parallel list ranking / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Faster optimal parallel prefix sums and list ranking / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3725547 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:07, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees |
scientific article |
Statements
Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees (English)
0 references
1988
0 references
parallel algorithm
0 references
independent sets in trees
0 references
minimum spanning trees
0 references
