Scribd Logo
Upload

Welcome to Scribd!

  • Slides Algo-Karger-Algorithm Typed

    Uploaded by

    impha
    9 views5 pages
    The document describes the random contraction algorithm for finding a minimum cut in a graph. It works by repeatedly contracting random edges until only two vertices remain, returning the cut defined by these vertices. An example shows the algorithm contracting edges in a graph until a minimum cut is identified between the final two vertices. The key question is determining the probability that the random contraction algorithm succeeds in finding an actual minimum cut.

    Original Description:

    Original Title

    slides_algo-karger-algorithm_typed

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes the random contraction algorithm for finding a minimum cut in a graph. It works by repeatedly contracting random edges until only two vertices remain, returning the cut defined by these vertices. An example shows the algorithm contracting edges in a graph until a minimum cut is identified between the final two vertices. The key question is determining the probability that the random contraction algorithm succeeds in finding an actual minimum cut.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    9 views5 pages

    Slides Algo-Karger-Algorithm Typed

    Uploaded by

    impha
    The document describes the random contraction algorithm for finding a minimum cut in a graph. It works by repeatedly contracting random edges until only two vertices remain, returning the cut defined by these vertices. An example shows the algorithm contracting edges in a graph until a minimum cut is identified between the final two vertices. The key question is determining the probability that the random contraction algorithm succeeds in finding an actual minimum cut.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 5

    Contrac(on

     
    Algorithm  
    The  Algorithm  
    Design  and  Analysis  
    of  Algorithms  I  
    The  Minimum  Cut  Problem  
    •  INPUT: An undirected graph G = ( V, E ).
    [ Parallel edges allowed]
    [See other video for representation of the input]

    •  GOAL: Compute a cut with fewest number of crossing


    edges. (a min cut)

    Tim  Roughgarden  
    Random  Contrac(on  Algorithm  
    [  due  to  Karger,  early  90s]  

    While there are more than 2 vertices:


    •  pick a remaining edge (u,v) uniformly at random
    •  merge (or “contract” ) u and v into a single vertex
    •  remove self-loops
    return cut represented by final 2 vertices.

    Tim  Roughgarden  
    Example  

    delete self-loops

           =>  Corresponds  to  the  cut       (  a  min    


    cut!  )  

    Tim  Roughgarden  
    Example  (con’d)   KEY
    QUESTION:
    What is the
    probability of
    success?

    (  not  a  min  cut!  )  


       Corresponds  to  the  cut    

    Tim  Roughgarden  

    You might also like