Minimum cuts in near-linear time (Q5487825): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128379265, #quickstatements; #temporary_batch_1730404649853
 
Property / Wikidata QID
 
Property / Wikidata QID: Q128379265 / rank
 
Normal rank

Latest revision as of 21:00, 31 October 2024

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

    Minimum cuts in near-linear time (English)
    0 references
    12 September 2006
    0 references
    time bounds
    0 references
    minimum cut problem on undirected graphs
    0 references
    randomized Monte Carlo algorithm
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references