Pages that link to "Item:Q1853562"

The following pages link to The complexity of the characterization of networks supporting shortest-path interval routing. (Q1853562):

Displayed 10 items.

• Ordered interval routing schemes (Q1044020) ‎ (← links)
• Interval routing in some planar networks. (Q1401175) ‎ (← links)
• A survey on interval routing (Q1575744) ‎ (← links)
• Static and dynamic low-congested interval routing schemes (Q1605315) ‎ (← links)
• Interval routing in reliability networks (Q1770375) ‎ (← links)
• The compactness of adaptive routing tables (Q1827290) ‎ (← 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)
• Interval Routing Schemes for Circular-Arc Graphs (Q2979675) ‎ (← links)
• Compact and localized distributed data structures (Q5138487) ‎ (← links)