The Computer Journal
A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Space-efficient message routing in c-decomposable networks
SIAM Journal on Computing
Improved routing strategies with succinct tables
Journal of Algorithms
European Journal of Combinatorics - Special issue on discrete metric spaces
Journal of Parallel and Distributed Computing
Journal of Algorithms
Regular Article: Graphs of Some CAT(0) Complexes
Advances in Applied Mathematics
Theoretical Computer Science
Decomposition and l1-embedding of weakly median graphs
European Journal of Combinatorics
Deadlock-Free Interval Routing Schemes
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Geometry of Cuts and Metrics
Distance and routing labeling schemes for non-positively curved plane graphs
Journal of Algorithms
Hi-index | 5.23 |
In this article, we design optimal or near optimal interval routing schemes (IRS, for short) with small compactness for several classes of plane quadrangulations and triangulations (by optimality or near optimality we mean that messages are routed via shortest or almost shortest paths). We show that the subgraphs of the rectilinear grid bounded by simple circuits allow optimal IRS with at most two circular intervals per edge (2-IRS). We extend this result to all plane quadrangulations in which all inner vertices have degrees ≥ 4. Namely, we establish that every such graph has an optimal IRS with at most seven linear intervals per edge (7-LIRS). This leads to a 7-LIRS with the stretch factor 2 for all plane triangulations in which all inner vertices have degrees ≥ 6. All routing schemes can be implemented in linear time.