Pages that link to "Item:Q4345573"
From MaRDI portal
The following pages link to A lower bound for interval routing in general networks (Q4345573):
Displaying 12 items.
- A short note on the lower bound of dilation for \(O(\log n)\)-label interval routing (Q1041783) (← links)
- On interval routing schemes and treewidth (Q1383155) (← links)
- The complexity of shortest path and dilation bounded interval routing (Q1575668) (← links)
- A survey on interval routing (Q1575744) (← links)
- New bounds for multi-label interval routing (Q1884964) (← links)
- Labelling and Implicit Routing in Networks (Q3220503) (← links)
- Worst Case Bounds for Shortest Path Interval Routing (Q4209271) (← links)
- More on the Efficiency of Interval Routing (Q4226621) (← links)
- (Q4262693) (← links)
- Interval Routing onk-Trees (Q4386452) (← links)
- Partial characterizations of networks supporting shortest path interval labeling schemes (Q4540069) (← links)
- A fault-tolerant routing scheme in dynamic networks (Q5959357) (← links)