Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees (Q1098631)
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: Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees |
scientific article; zbMATH DE number 4039289
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees |
scientific article; zbMATH DE number 4039289 |
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
0.9358676
0 references
0.9299682
0 references
0.9295821
0 references
0.91785705
0 references
0.91650295
0 references
0.91650295
0 references
