Finding maximum matching for bipartite graphs in parallel (Q1342094): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 03:01, 5 March 2024

scientific article
Language Label Description Also known as
English
Finding maximum matching for bipartite graphs in parallel
scientific article

    Statements

    Finding maximum matching for bipartite graphs in parallel (English)
    0 references
    0 references
    11 January 1995
    0 references
    parallel algorithm
    0 references
    maximum matching
    0 references
    bipartite graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references