Matching algorithms are fast in sparse random graphs (Q2432523)

From MaRDI portal
Revision as of 22:20, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Matching algorithms are fast in sparse random graphs
scientific article

    Statements

    title
    Matching algorithms are fast in sparse random graphs (English)
    0 references
    author
    Holger Bast
    0 references
    Kurt Mehlhorn
    0 references
    Guido Schäfer
    0 references
    Hisao Tamaki
    0 references
    publication date
    25 October 2006
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C70
    0 references
    05C80
    0 references
    05C85
    0 references
    68Q25
    0 references
    68W05
    0 references
    zbMATH DE Number
    5067355
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2432523&oldid=15103596"
    Powered by MediaWiki