Strong-diameter decompositions of minor free graphs (Q613118): Difference between revisions

@@ Property / cites work @@
+Object location using path separators
@@ Property / cites work: Object location using path separators / rank @@
+Normal rank
@@ Property / cites work @@
+Routing with Improved Communication-Space Trade-Off
+Normal rank
@@ Property / cites work @@
+Compact name-independent routing with minimum stretch
+Normal rank
@@ Property / cites work @@
+Distributed Computing
@@ Property / cites work: Distributed Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Routing with Polynomial Communication-Space Trade-Off
+Normal rank
@@ Property / cites work @@
+Improved sparse covers for graphs excluding a fixed minor
+Normal rank
@@ Property / cites work @@
+Lower-stretch spanning trees
@@ Property / cites work: Lower-stretch spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Excluded minors, network decomposition, and multicommodity flow
+Normal rank
@@ Property / cites work @@
+The extremal function for complete minors
@@ Property / cites work: The extremal function for complete minors / rank @@
+Normal rank
@@ Property / cites work @@
+Compact oracles for reachability and approximate distances in planar digraphs
+Normal rank
@@ Property / cites work @@
+Approximate distance oracles
@@ Property / cites work: Approximate distance oracles / rank @@
+Normal rank