Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering (Q525113): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Peter Sanders / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6708818 / rank
 
Normal rank
Property / zbMATH Keywords
 
multilevel graph partitioning
Property / zbMATH Keywords: multilevel graph partitioning / rank
 
Normal rank
Property / zbMATH Keywords
 
size-constrained graph clustering
Property / zbMATH Keywords: size-constrained graph clustering / rank
 
Normal rank
Property / zbMATH Keywords
 
heuristics
Property / zbMATH Keywords: heuristics / rank
 
Normal rank
Property / zbMATH Keywords
 
label propagation
Property / zbMATH Keywords: label propagation / rank
 
Normal rank
Property / zbMATH Keywords
 
aggressive graph coarsening
Property / zbMATH Keywords: aggressive graph coarsening / rank
 
Normal rank

Revision as of 07:25, 1 July 2023

scientific article
Language Label Description Also known as
English
Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
scientific article

    Statements

    Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 April 2017
    0 references
    0 references
    multilevel graph partitioning
    0 references
    size-constrained graph clustering
    0 references
    heuristics
    0 references
    label propagation
    0 references
    aggressive graph coarsening
    0 references