Pages that link to "Item:Q3220503"
From MaRDI portal
The following pages link to Labelling and Implicit Routing in Networks (Q3220503):
Displaying 50 items.
- Distributed computing of efficient routing schemes in generalized chordal graphs (Q442251) (← links)
- Characterization of networks supporting multi-dimensional linear interval routing schemes (Q703538) (← links)
- Average stretch analysis of compact routing schemes (Q875595) (← links)
- On compact and efficient routing in certain graph classes (Q997073) (← links)
- A note on models for graph representations (Q1008739) (← links)
- A short note on the lower bound of dilation for \(O(\log n)\)-label interval routing (Q1041783) (← links)
- Ordered interval routing schemes (Q1044020) (← links)
- Designing networks with compact routing tables (Q1104109) (← links)
- Multidimensional interval routing schemes (Q1275073) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- On interval routing schemes and treewidth (Q1383155) (← links)
- On devising Boolean Routing Schemes (Q1389768) (← links)
- The complexity of shortest path and dilation bounded interval routing (Q1575668) (← links)
- A survey on interval routing (Q1575744) (← links)
- On the complexity of multi-dimensional interval routing schemes (Q1575745) (← links)
- Static and dynamic low-congested interval routing schemes (Q1605315) (← links)
- Compact routing messages in self-healing trees (Q1686108) (← links)
- Routing in unit disk graphs (Q1742368) (← links)
- Distance labeling schemes for well-separated graph classes (Q1765518) (← links)
- Interval routing in reliability networks (Q1770375) (← links)
- The compactness of adaptive routing tables (Q1827290) (← links)
- The complexity of the characterization of networks supporting shortest-path interval routing. (Q1853562) (← links)
- New bounds for multi-label interval routing (Q1884964) (← links)
- Searching among intervals and compact routing tables (Q1913700) (← links)
- General compact labeling schemes for dynamic trees (Q1954239) (← links)
- Local routing in a tree metric \(1\)-spanner (Q2084633) (← links)
- Routing among convex polygonal obstacles in the plane (Q2149846) (← links)
- Routing in polygonal domains (Q2173455) (← links)
- Near-optimal induced universal graphs for cycles and paths (Q2185721) (← links)
- Bounding the locality of distributed routing algorithms (Q2375823) (← links)
- How to use spanning trees to navigate in graphs (Q2375948) (← links)
- Proof labeling schemes (Q2377139) (← links)
- All-shortest-path 2-interval routing is NP-complete (Q2380872) (← links)
- Distributed distance computation and routing with small messages (Q2422769) (← links)
- On the hardness of minimizing space for all-shortest-path interval routing schemes (Q2465642) (← links)
- Informative labeling schemes for graphs (Q2566038) (← links)
- Characterization results of all shortest paths interval routing schemes (Q2744657) (← links)
- Link reversal routing with binary link labels: work complexity (Q2840988) (← links)
- Interval Routing Schemes for Circular-Arc Graphs (Q2979675) (← links)
- Secure Authenticated Comparisons (Q3011317) (← links)
- How to Use Spanning Trees to Navigate in Graphs (Q3182932) (← links)
- Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs (Q3408176) (← links)
- Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks (Q3654248) (← 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)
- Routing in Polygonal Domains (Q5136225) (← links)
- Universal routing schemes (Q5137328) (← links)
- Sparse communication networks and efficient routing in the plane (Q5138362) (← links)
- Interval routing schemes allow broadcasting with linear message-complexity (Q5138363) (← links)