Modularity-maximizing graph communities via mathematical programming (Q977873): Difference between revisions

@@ Property / DOI @@
-.1140/epjb/e2008-00425-1
@@ Property / DOI: 10.1140/epjb/e2008-00425-1 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.2533
@@ Property / arXiv ID: 0710.2533 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5386180
@@ Property / cites work: Q5386180 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4397004
@@ Property / cites work: Q4397004 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2753729
@@ Property / cites work: Q2753729 / rank @@
+Normal rank
@@ Property / cites work @@
+Significance-Driven Graph Clustering
@@ Property / cites work: Significance-Driven Graph Clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3140399
@@ Property / cites work: Q3140399 / rank @@
+Normal rank
@@ Property / DOI @@
+.1140/EPJB/E2008-00425-1
@@ Property / DOI: 10.1140/EPJB/E2008-00425-1 / rank @@
+Normal rank