Network reinforcement (Q2583121): Difference between revisions

@@ Property / DOI @@
-.1007/s10107-005-0648-6
@@ Property / DOI: 10.1007/s10107-005-0648-6 / rank @@
-Normal rank
@@ Property / cites work @@
+Improved Algorithms for Bipartite Network Flow
@@ Property / cites work: Improved Algorithms for Bipartite Network Flow / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal cooperation and submodularity for computing Potts  partition functions with a large number of states
+Normal rank
@@ Property / cites work @@
+Separation of Partition Inequalities
@@ Property / cites work: Separation of Partition Inequalities / rank @@
+Normal rank
@@ Property / cites work @@
+Separating from the dominant of the spanning tree polytope
+Normal rank
@@ Property / cites work @@
+A faster algorithm for computing the strength of a network
+Normal rank
@@ Property / cites work @@
+Minimum cuts, modular functions, and matroid polyhedra
+Normal rank
@@ Property / cites work @@
+Optimal attack and reinforcement of a network
@@ Property / cites work: Optimal attack and reinforcement of a network / rank @@
+Normal rank
@@ Property / cites work @@
+Q5684698
@@ Property / cites work: Q5684698 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Graphic Polymatroids and Parametrics-Sets
+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 @@
+Geometric algorithms and combinatorial optimization.
+Normal rank
@@ Property / cites work @@
+Connectivity and edge-disjoint spanning trees
@@ Property / cites work: Connectivity and edge-disjoint spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Strength of a Graph
@@ Property / cites work: Computing the Strength of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
+Normal rank
@@ Property / cites work @@
+New primal and dual matching heuristics
@@ Property / cites work: New primal and dual matching heuristics / rank @@
+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 @@
+Trees and Cuts
@@ Property / cites work: Trees and Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Selected Applications of Minimum Cuts in Networks
@@ Property / cites work: Selected Applications of Minimum Cuts in Networks / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank
@@ Property / DOI @@
+.1007/S10107-005-0648-6
@@ Property / DOI: 10.1007/S10107-005-0648-6 / rank @@
+Normal rank