In search of dense subgraphs: How good is greedy peeling? (Q6087137): Difference between revisions

@@ Property / cites work @@
+Q3044359
@@ Property / cites work: Q3044359 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Dense Subgraphs with Size Bounds
@@ Property / cites work: Finding Dense Subgraphs with Size Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Greedily Finding a Dense Subgraph
@@ Property / cites work: Greedily Finding a Dense Subgraph / rank @@
+Normal rank
@@ Property / cites work @@
+Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem
+Normal rank
@@ Property / cites work @@
+Q2753729
@@ Property / cites work: Q2753729 / rank @@
+Normal rank
@@ Property / cites work @@
+The university of Florida sparse matrix collection
+Normal rank
@@ Property / cites work @@
+A Fast Parametric Maximum Flow Algorithm and Applications
+Normal rank
@@ Property / cites work @@
+A new approach to the maximum-flow problem
@@ Property / cites work: A new approach to the maximum-flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+Practical Minimum Cut Algorithms
@@ Property / cites work: Practical Minimum Cut Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On Finding Dense Subgraphs
@@ Property / cites work: On Finding Dense Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
+Normal rank
@@ Property / cites work @@
+Discounted average degree density metric and new algorithms for the densest subgraph problem
+Normal rank