Augmenting edge-connectivity between vertex subsets (Q472470): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-012-9724-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2044052083
@@ Property / OpenAlex ID: W2044052083 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering symmetric supermodular functions by graphs
+Normal rank
@@ Property / cites work @@
+A New Approach to Splitting-Off
@@ Property / cites work: A New Approach to Splitting-Off / rank @@
+Normal rank
@@ Property / cites work @@
+Augmentation Problems
@@ Property / cites work: Augmentation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting Graphs to Meet Edge-Connectivity Requirements
+Normal rank
@@ Property / cites work @@
+Efficient splitting off algorithms for graphs
@@ Property / cites work: Efficient splitting off algorithms for graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4845372
@@ Property / cites work: Q4845372 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs
+Normal rank
@@ Property / cites work @@
+Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
+Normal rank
@@ Property / cites work @@
+Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
+Normal rank
@@ Property / cites work @@
+Tight approximation algorithm for connectivity augmentation problems
+Normal rank
@@ Property / cites work @@
+NA-EDGE-CONNECTIVITY AUGMENTATION PROBLEMS BY ADDING EDGES(&lt;Special Issue&gt;Network Design, Control and Optimization)
+Normal rank
@@ Property / cites work @@
+GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(&lt;Special Issue&gt;Network Design, Control and Optimization)
+Normal rank
@@ Property / cites work @@
+Graph connectivity and its augmentation: Applications of MA orderings
+Normal rank
@@ Property / cites work @@
+Approximating connectivity augmentation problems
@@ Property / cites work: Approximating connectivity augmentation problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4527015
@@ Property / cites work: Q4527015 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Transversals in Posimodular Systems
@@ Property / cites work: Minimum Transversals in Posimodular Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-connectivity augmentation of graphs over symmetric parity families
+Normal rank
@@ Property / cites work @@
+Edge-Connectivity Augmentations of Graphs and Hypergraphs
+Normal rank
@@ Property / cites work @@
+Edge-connectivity augmentation problems
@@ Property / cites work: Edge-connectivity augmentation problems / rank @@
+Normal rank
@@ Property / cites work @@
+An analysis of the greedy algorithm for the submodular set covering problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:472470