Electric routing and concurrent flow cutting (Q553348): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2010.06.013
+Normal rank
@@ Property / OpenAlex ID @@
+W2570775423
@@ Property / OpenAlex ID: W2570775423 / rank @@
+Normal rank
@@ Property / cites work @@
+Compact name-independent routing with minimum stretch
+Normal rank
@@ Property / cites work @@
+Open problems of Paul Erd�s in graph theory
@@ Property / cites work: Open problems of Paul Erd�s in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4709170
@@ Property / cites work: Q4709170 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4633869
@@ Property / cites work: Q4633869 / rank @@
+Normal rank
@@ Property / cites work @@
+New lower bounds for oblivious routing in undirected graphs
+Normal rank
@@ Property / cites work @@
+Q3579444
@@ Property / cites work: Q3579444 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+Q3549709
@@ Property / cites work: Q3549709 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5302080
@@ Property / cites work: Q5302080 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate distance oracles
@@ Property / cites work: Approximate distance oracles / rank @@
+Normal rank