Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs (Q860392): Difference between revisions

@@ Property / OpenAlex ID @@
+W2170837469
@@ Property / OpenAlex ID: W2170837469 / rank @@
+Normal rank
@@ Property / cites work @@
+Locating Sources to Meet Flow Demands in Undirected Networks
+Normal rank
@@ Property / cites work @@
+Augmenting Undirected Edge Connectivity in Õ(n2) Time
+Normal rank
@@ Property / cites work @@
+Augmenting Graphs to Meet Edge-Connectivity Requirements
+Normal rank
@@ Property / cites work @@
+Q4845372
@@ Property / cites work: Q4845372 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2843925
@@ Property / cites work: Q2843925 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge connectivity between nodes and node-subsets
@@ Property / cites work: Edge connectivity between nodes and node-subsets / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
+Normal rank
@@ Property / cites work @@
+Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
+Normal rank
@@ Property / cites work @@
+Graph connectivity and its augmentation: Applications of MA orderings
+Normal rank
@@ Property / cites work @@
+Minimum cost source location problem with vertex-connectivity requirements in digraphs
+Normal rank
@@ Property / cites work @@
+Hypergraph connectivity augmentation
@@ Property / cites work: Hypergraph connectivity augmentation / rank @@
+Normal rank