Pages that link to "Item:Q2744657"
From MaRDI portal
The following pages link to Characterization results of all shortest paths interval routing schemes (Q2744657):
Displaying 10 items.
- Ordered interval routing schemes (Q1044020) (← links)
- On devising Boolean Routing Schemes (Q1389768) (← links)
- A survey on interval routing (Q1575744) (← links)
- The compactness of adaptive routing tables (Q1827290) (← links)
- The complexity of the characterization of networks supporting shortest-path interval routing. (Q1853562) (← links)
- Analysis of shortest paths and subscriber line lengths in telecommunication access networks (Q2379703) (← links)
- All-shortest-path 2-interval routing is NP-complete (Q2380872) (← links)
- On the hardness of minimizing space for all-shortest-path interval routing schemes (Q2465642) (← links)
- Worst Case Bounds for Shortest Path Interval Routing (Q4209271) (← links)
- Structural Information and Communication Complexity (Q5315234) (← links)