Labelling and Implicit Routing in Networks
From MaRDI portal
Publication:3220503
DOI10.1093/comjnl/28.1.5zbMath0555.94026OpenAlexW2151358465MaRDI QIDQ3220503
Publication date: 1985
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/28.1.5
acyclic graphscomputer communication networkimplicit routing algorithmlabelling scheme for graphs of arbitrary topology
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of graph theory to circuits and networks (94C15)
Related Items
New bounds for multi-label interval routing, Deadlock-free interval routing schemes, 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, Searching among intervals and compact routing tables, How to Use Spanning Trees to Navigate in Graphs, Routing among convex polygonal obstacles in the plane, Designing networks with compact routing tables, Searching among intervals and compact routing tables, Routing in polygonal domains, Average stretch analysis of compact routing schemes, On interval routing schemes and treewidth, On devising Boolean Routing Schemes, Near-optimal induced universal graphs for cycles and paths, Compact routing messages in self-healing trees, Multi-dimensional Interval Routing Schemes, Distributed distance computation and routing with small messages, On Interval Routing Schemes and treewidth, On devising Boolean Routing schemes, On multi-label linear interval routing schemes, Distributed computing of efficient routing schemes in generalized chordal graphs, General compact labeling schemes for dynamic trees, Interval Routing Schemes for Circular-Arc Graphs, 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, On the hardness of minimizing space for all-shortest-path interval routing schemes, Routing in unit disk graphs, Secure Authenticated Comparisons, Characterization results of all shortest paths interval routing schemes, Compact Routing in Unit Disk Graphs, Independent tree spanners: Fault-tolerant spanning trees with constant distance guarantees, Representing graphs implicitly using almost optimal space, Distance labeling schemes for well-separated graph classes, Characterization of networks supporting multi-dimensional linear interval routing schemes, Interval routing in reliability networks, Interval routing schemes, Low-congested interval routing schemes for hypercubelike networks, A fault-tolerant routing scheme in dynamic networks, On compact and efficient routing in certain graph classes, A note on models for graph representations, Multidimensional interval routing schemes, The compactness of adaptive routing tables, Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs, The complexity of shortest path and dilation bounded interval routing, A survey on interval routing, On the complexity of multi-dimensional interval routing schemes, A short note on the lower bound of dilation for \(O(\log n)\)-label interval routing, Ordered interval routing schemes, Informative labeling schemes for graphs, Local routing in a tree metric \(1\)-spanner, The complexity of the characterization of networks supporting shortest-path interval routing., Routing in Polygonal Domains, Static and dynamic low-congested interval routing schemes, Graph theoretical issues in computer networks
