Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering (Q525113): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 2 users not shown) | |||
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 |
Revision as of 03:18, 20 March 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
28 April 2017
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