An efficient parallel algorithm for maximum matching for some classes of graphs (Q1268785)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An efficient parallel algorithm for maximum matching for some classes of graphs
scientific article

    Statements

    An efficient parallel algorithm for maximum matching for some classes of graphs (English)
    0 references
    1998
    0 references
    modular decomposition
    0 references
    matching parallel algorithm
    0 references
    0 references

    Identifiers