Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs (Q5219669): Difference between revisions

@@ Property / cites work @@
+Local Restrictions for Various Classes of Directed Graphs
+Normal rank
@@ Property / cites work @@
+Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings
+Normal rank
@@ Property / cites work @@
+Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation
+Normal rank
@@ Property / cites work @@
+Matrices of 0's and 1's with total support
@@ Property / cites work: Matrices of 0's and 1's with total support / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Matrix Theory
@@ Property / cites work: Combinatorial Matrix Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography
+Normal rank
@@ Property / cites work @@
+Existence of k-edge connected ordinary graphs with prescribed degrees
+Normal rank
@@ Property / cites work @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting Graphs to Meet Edge-Connectivity Requirements
+Normal rank
@@ Property / cites work @@
+Q3085455
@@ Property / cites work: Q3085455 / 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 @@
+An algorithm to increase the node-connectivity of a digraph by one
+Normal rank
@@ Property / cites work @@
+A theorem on flows in networks
@@ Property / cites work: A theorem on flows in networks / rank @@
+Normal rank
@@ Property / cites work @@
+Characterization of Digraphic Sequences with Strongly Connected Realizations
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
+Normal rank
@@ Property / cites work @@
+Studies on directed graphs. I, II
@@ Property / cites work: Studies on directed graphs. I, II / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Properties of Matrices of Zeros and                         Ones
+Normal rank
@@ Property / cites work @@
+A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
+Normal rank
@@ Property / cites work @@
+Primal-dual approach for directed vertex connectivity augmentation and generalizations
+Normal rank
@@ Property / cites work @@
+On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
+Normal rank