An algorithm to increase the node-connectivity of a digraph by one (Q955325): Difference between revisions

@@ Property / cites work @@
+Augmentation Problems
@@ Property / cites work: Augmentation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Uncrossing a family of set-pairs
@@ Property / cites work: Uncrossing a family of set-pairs / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Augmenting Graphs to Meet Edge-Connectivity Requirements
+Normal rank
@@ Property / cites work @@
+Finding minimum generators of path systems
@@ Property / cites work: Finding minimum generators of path systems / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal edge-coverings of pairs of sets
@@ Property / cites work: Minimal edge-coverings of pairs of sets / rank @@
+Normal rank
@@ Property / cites work @@
+Directed vertex-connectivity augmentation
@@ Property / cites work: Directed vertex-connectivity augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+A minimax theorem on intervals
@@ Property / cites work: A minimax theorem on intervals / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921669
@@ Property / cites work: Q2921669 / rank @@
+Normal rank