Labelling and Implicit Routing in Networks
From MaRDI portal
Recommendations
Cited in
(67)- A note on models for graph representations
- A short note on the lower bound of dilation for \(O(\log n)\)-label interval routing
- Ordered interval routing schemes
- Designing networks with compact routing tables
- Multidimensional interval routing schemes
- Graph theoretical issues in computer networks
- On interval routing schemes and treewidth
- On devising Boolean Routing Schemes
- The complexity of shortest path and dilation bounded interval routing
- A survey on interval routing
- On the complexity of multi-dimensional interval routing schemes
- Static and dynamic low-congested interval routing schemes
- Compact routing messages in self-healing trees
- Distance labeling schemes for well-separated graph classes
- Interval routing in reliability networks
- The compactness of adaptive routing tables
- The complexity of the characterization of networks supporting shortest-path interval routing.
- New bounds for multi-label interval routing
- Searching among intervals and compact routing tables
- General compact labeling schemes for dynamic trees
- Local routing in a tree metric 1-spanner
- Routing among convex polygonal obstacles in the plane
- Routing in polygonal domains
- Near-optimal induced universal graphs for cycles and paths
- Bounding the locality of distributed routing algorithms
- How to use spanning trees to navigate in graphs
- Proof labeling schemes
- All-shortest-path 2-interval routing is NP-complete
- Distributed distance computation and routing with small messages
- On the hardness of minimizing space for all-shortest-path interval routing schemes
- Informative labeling schemes for graphs
- Characterization results of all shortest paths interval routing schemes
- Link reversal routing with binary link labels: work complexity
- Interval routing schemes for circular-arc graphs
- Secure authenticated comparisons
- How to Use Spanning Trees to Navigate in Graphs
- Distributed computing of efficient routing schemes in generalized chordal graphs
- 0-1 labelling for network characterization
- Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks
- scientific article; zbMATH DE number 4062571 (Why is no real title available?)
- Distributed computing of efficient routing schemes in generalized chordal graphs
- Low-congested interval routing schemes for hypercubelike networks
- Searching among intervals and compact routing tables
- Deadlock-free interval routing schemes
- Routing in polygonal domains
- Universal routing schemes
- Sparse communication networks and efficient routing in the plane
- Interval routing schemes allow broadcasting with linear message-complexity
- Compact and localized distributed data structures
- Interval routing schemes
- Independent tree spanners: Fault-tolerant spanning trees with constant distance guarantees
- Representing graphs implicitly using almost optimal space
- A fault-tolerant routing scheme in dynamic networks
- Compact Routing in Unit Disk Graphs
- Multi-dimensional Interval Routing Schemes
- On Interval Routing Schemes and treewidth
- On devising Boolean Routing schemes
- On multi-label linear interval routing schemes
- A lower bound for linear interval routing
- Topological routing schemes
- Routing among convex polygonal obstacles in the plane
- Restorable shortest path tiebreaking for edge-faulty graphs
- Characterization of networks supporting multi-dimensional linear interval routing schemes
- Optimal Euclidean tree covers
- Routing among convex polygonal obstacles in the plane using a simplified domain
- Average stretch analysis of compact routing schemes
- On compact and efficient routing in certain graph classes
This page was built for publication: Labelling and Implicit Routing in Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3220503)
