Minimum cuts in near-linear time (Q5487825)

From MaRDI portal
Revision as of 21:00, 31 October 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128379265, #quickstatements; #temporary_batch_1730404649853)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5052708
Language Label Description Also known as
English
Minimum cuts in near-linear time
scientific article; zbMATH DE number 5052708

    Statements

    title
    Minimum cuts in near-linear time (English)
    0 references
    publication date
    12 September 2006
    0 references
    zbMATH Keywords
    time bounds
    0 references
    minimum cut problem on undirected graphs
    0 references
    randomized Monte Carlo algorithm
    0 references
    author
    David R. Karger
    0 references

    Identifiers

    DOI
    10.1145/331605.331608
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C85
    0 references
    68W20
    0 references
    zbMATH DE Number
    5052708
    0 references
    OpenAlex ID
    W1964510837
    0 references
    Wikidata QID
    Q128379265
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5487825&oldid=37867974"
    Powered by MediaWiki