Pages that link to "Item:Q1575745"
From MaRDI portal
The following pages link to On the complexity of multi-dimensional interval routing schemes (Q1575745):
Displaying 12 items.
- Characterization of networks supporting multi-dimensional linear interval routing schemes (Q703538) (← links)
- Multidimensional interval routing schemes (Q1275073) (← links)
- A survey on interval routing (Q1575744) (← links)
- Static and dynamic low-congested interval routing schemes (Q1605315) (← links)
- The complexity of routing with collision avoidance (Q1741493) (← links)
- The compactness of adaptive routing tables (Q1827290) (← links)
- The complexity of the characterization of networks supporting shortest-path interval routing. (Q1853562) (← links)
- Searching among intervals and compact routing tables (Q1913700) (← links)
- On the hardness of minimizing space for all-shortest-path interval routing schemes (Q2465642) (← links)
- On the computational complexity of continuous routing (Q4203819) (← links)
- (Q4945787) (← links)
- Compact and localized distributed data structures (Q5138487) (← links)