Space-Efficient Message Routing inc-Decomposable Networks
From MaRDI portal
Recommendations
Cited in
(20)- Not all planar digraphs have small cycle separators
- Multidimensional interval routing schemes
- Graph theoretical issues in computer networks
- On devising Boolean Routing Schemes
- Interval routing in some planar networks.
- A survey on interval routing
- Compact routing messages in self-healing trees
- The compactness of adaptive routing tables
- An optimal message routing algorithm for double-loop networks
- Space-efficient and fault-tolerant message routing in outerplanar networks
- Efficient Message Routing in Planar Networks
- Proximity-preserving labeling schemes
- Compact and localized distributed data structures
- The Space Requirement of Local Forwarding on Acyclic Networks
- Interval routing schemes
- Representing graphs implicitly using almost optimal space
- Multi-dimensional Interval Routing Schemes
- On devising Boolean Routing schemes
- On multi-label linear interval routing schemes
- Topological routing schemes
This page was built for publication: Space-Efficient Message Routing inc-Decomposable Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474267)