A spectral heuristic for bisecting random graphs (Q3419599)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A spectral heuristic for bisecting random graphs
scientific article

    Statements

    A spectral heuristic for bisecting random graphs (English)
    0 references
    0 references
    0 references
    7 February 2007
    0 references
    0 references
    probabilistic algorithm
    0 references
    minimum bisection
    0 references
    0 references
    0 references