The complexity of shortest path and dilation bounded interval routing (Q1575668): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4262693
@@ Property / cites work: Q4262693 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of interval routing on random graphs
+Normal rank
@@ Property / cites work @@
+A characterization of networks supporting linear interval routing
+Normal rank
@@ Property / cites work @@
+Interval routing schemes
@@ Property / cites work: Interval routing schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for compact routing
@@ Property / cites work: Lower bounds for compact routing / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic routing with bounded buffers: turning offline into online protocols
+Normal rank
@@ Property / cites work @@
+A trade-off between space and efficiency for routing tables
+Normal rank
@@ Property / cites work @@
+Q3815249
@@ Property / cites work: Q3815249 / rank @@
+Normal rank
@@ Property / cites work @@
+Labelling and Implicit Routing in Networks
@@ Property / cites work: Labelling and Implicit Routing in Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4345573
@@ Property / cites work: Q4345573 / rank @@
+Normal rank
@@ Property / cites work @@
+Interval Routing
@@ Property / cites work: Interval Routing / rank @@
+Normal rank