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

@@ Property / author @@
-Peter Sanders
@@ Property / author: Peter Sanders / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+KaFFPa
@@ Property / describes a project that uses: KaFFPa / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SNAP
@@ Property / describes a project that uses: SNAP / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+JOSTLE
@@ Property / describes a project that uses: JOSTLE / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+hMETIS
@@ Property / describes a project that uses: hMETIS / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Scotch
@@ Property / describes a project that uses: Scotch / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SNAP
@@ Property / describes a project that uses: SNAP / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+KaHIP
@@ Property / describes a project that uses: KaHIP / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+kMetis
@@ Property / describes a project that uses: kMetis / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10732-016-9315-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2529573338
@@ Property / OpenAlex ID: W2529573338 / rank @@
+Normal rank