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

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: hMETIS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Scotch / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SNAP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: KaHIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: kMetis / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10732-016-9315-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2529573338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2912418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding good approximate vertex and edge partitions is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitioning models for parallel computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Analysis of a Label Propagation Algorithm for Community Detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5298943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilevel refinement for combinatorial optimisation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilevel local search algorithms for modularity clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering Multilevel Graph Partitioning Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm / rank
 
Normal rank

Latest revision as of 18:29, 13 July 2024

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
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references