A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning (Q2839169)

From MaRDI portal
Revision as of 08:54, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
scientific article

    Statements

    A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning (English)
    0 references
    4 July 2013
    0 references
    graph clustering
    0 references
    graph partitioning
    0 references
    local algorithms
    0 references
    sparsest cut
    0 references
    approximation algorithms
    0 references
    0 references
    0 references

    Identifiers

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