Fast approximation for computing the fractional arboricity and extraction of communities of a graph (Q313816): Difference between revisions

@@ Property / cites work @@
+Evolution of the social network of scientific collaborations
+Normal rank
@@ Property / cites work @@
+Q2753729
@@ Property / cites work: Q2753729 / rank @@
+Normal rank
@@ Property / cites work @@
+A short proof of Nash-Williams' theorem for the arboricity of a graph
+Normal rank
@@ Property / cites work @@
+Communication networks from the enron email corpus ``It's always about the people. Enron is no different''
+Normal rank
@@ Property / cites work @@
+Minimum partition of a matroid into independent subsets
+Normal rank
@@ Property / cites work @@
+Packing algorithms for arborescences (and spanning trees) in capacitated graphs
+Normal rank
@@ Property / cites work @@
+Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Communities in Large Networks Using Random Walks
+Normal rank
@@ Property / cites work @@
+Q3330973
@@ Property / cites work: Q3330973 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank