Algorithms for finding a rooted \((k,1)\)-edge-connected orientation (Q2636819): Difference between revisions

@@ Property / cites work @@
+Minimum partition of a matroid into independent subsets
+Normal rank
@@ Property / cites work @@
+Q5514188
@@ Property / cites work: Q5514188 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4744300
@@ Property / cites work: Q4744300 / rank @@
+Normal rank
@@ Property / cites work @@
+On the orientation of graphs
@@ Property / cites work: On the orientation of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3085455
@@ Property / cites work: Q3085455 / rank @@
+Normal rank
@@ Property / cites work @@
+On the orientation of graphs and hypergraphs
@@ Property / cites work: On the orientation of graphs and hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized polymatroids and submodular flows
@@ Property / cites work: Generalized polymatroids and submodular flows / rank @@
+Normal rank
@@ Property / cites work @@
+Packing algorithms for arborescences (and spanning trees) in capacitated graphs
+Normal rank
@@ Property / cites work @@
+On the degrees of the vertices of a directed graph
+Normal rank
@@ Property / cites work @@
+A note on the Frank-Tardos bi-truncation algorithm for crossing- submodular functions
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank