Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees (Q1098631)

From MaRDI portal
Revision as of 20:44, 12 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    1988
    0 references
    parallel algorithm
    0 references
    independent sets in trees
    0 references
    minimum spanning trees
    0 references

    Identifiers