Computing large matchings fast (Q3188982)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computing large matchings fast
scientific article

    Statements

    Computing large matchings fast (English)
    0 references
    0 references
    0 references
    9 September 2014
    0 references
    3-connected planar graphs
    0 references
    3-regular graphs
    0 references
    large matchings
    0 references
    bounded-degree block trees
    0 references
    maxdeg-3 graphs
    0 references
    maximum matchings
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references