Pages that link to "Item:Q1104109"

The following pages link to Designing networks with compact routing tables (Q1104109):

Displaying 41 items.

• An optimal message routing algorithm for double-loop networks (Q293257) (← links)
• On the efficiency of routing in sensor networks (Q455964) (← links)
• Characterization of networks supporting multi-dimensional linear interval routing schemes (Q703538) (← links)
• Average stretch analysis of compact routing schemes (Q875595) (← links)
• Ordered interval routing schemes (Q1044020) (← links)
• Efficient parallel algorithms for shortest paths in planar digraphs (Q1196454) (← links)
• Multidimensional interval routing schemes (Q1275073) (← links)
• Graph theoretical issues in computer networks (Q1319540) (← links)
• Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q1351004) (← links)
• On interval routing schemes and treewidth (Q1383155) (← links)
• On devising Boolean Routing Schemes (Q1389768) (← links)
• Algorithmic graph embeddings (Q1391310) (← links)
• Optimal layouts on a chain ATM network (Q1392534) (← 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)
• Minimum cycle bases of weighted outerplanar graphs (Q1675771) (← links)
• The complexity of the characterization of networks supporting shortest-path interval routing. (Q1853562) (← links)
• Searching among intervals and compact routing tables (Q1913700) (← links)
• Characterization results of all shortest paths interval routing schemes (Q2744657) (← links)
• Interval Routing Schemes for Circular-Arc Graphs (Q2979675) (← links)
• Labelling and Implicit Routing in Networks (Q3220503) (← links)
• Efficient distributed algorithms for single-source shortest paths and related problems on plane networks (Q4000864) (← links)
• Low-congested interval routing schemes for hypercubelike networks (Q4520243) (← links)
• Searching among intervals and compact routing tables (Q4630246) (← links)
• Deadlock-free interval routing schemes (Q5048937) (← links)
• Efficient parallel algorithms for shortest paths in planar graphs (Q5056111) (← links)
• (Q5075823) (← links)
• Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q5096905) (← links)
• Interval routing schemes allow broadcasting with linear message-complexity (Q5138363) (← links)
• Compact and localized distributed data structures (Q5138487) (← links)
• Compact routing with slack (Q5401396) (← links)
• (Q5874505) (← links)
• Interval routing schemes (Q5916403) (← links)
• Compact policy routing (Q5920297) (← links)
• Graphs with bounded induced distance (Q5928866) (← links)
• Representing graphs implicitly using almost optimal space (Q5928875) (← links)
• Multi-dimensional Interval Routing Schemes (Q6084552) (← links)
• Algorithmic graph embeddings (Q6085703) (← links)
• Efficient algorithms for shortest path queries in planar digraphs (Q6550542) (← links)
• Topological routing schemes (Q6570920) (← links)