The following pages link to Interval routing schemes (Q5916403):
Displaying 13 items.
- Modeling recreational systems using optimization techniques and information technologies (Q478052) (← links)
- Ordered interval routing schemes (Q1044020) (← links)
- Multidimensional interval routing schemes (Q1275073) (← links)
- On devising Boolean Routing Schemes (Q1389768) (← links)
- Static and dynamic low-congested interval routing schemes (Q1605315) (← links)
- A note on the consecutive ones submatrix problem. (Q1853060) (← links)
- All-shortest-path 2-interval routing is NP-complete (Q2380872) (← links)
- The parameterized complexity of stabbing rectangles (Q2428672) (← links)
- Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices (Q2457012) (← links)
- On the hardness of minimizing space for all-shortest-path interval routing schemes (Q2465642) (← links)
- Characterization results of all shortest paths interval routing schemes (Q2744657) (← links)
- Deadlock-free interval routing schemes (Q5048937) (← links)
- Compact and localized distributed data structures (Q5138487) (← links)