scientific article; zbMATH DE number 4085576

MaRDI QIDQ3815249zbMATH OpenFDO

Authors Peter Ružička

Publication date 1988

zbMATH Keywords

computational complexitydistributed algorithmsrouting in communication networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 1038840
• Interval routing schemes
• Interval Routing
• More on the Efficiency of Interval Routing
• Interval routing schemes

Cited in

(20)

• Ordered interval routing schemes
• Multidimensional interval routing schemes
• Interval routing in some planar networks.
• The complexity of shortest path and dilation bounded interval routing
• A survey on interval routing
• Static and dynamic low-congested interval routing schemes
• Searching among intervals and compact routing tables
• A minimum interference routing algorithm with reduced computational complexity
• scientific article; zbMATH DE number 2088435 (Why is no real title available?)
• Interval Routing
• More on the Efficiency of Interval Routing
• scientific article; zbMATH DE number 1340883 (Why is no real title available?)
• scientific article; zbMATH DE number 1038840 (Why is no real title available?)
• scientific article; zbMATH DE number 1517100 (Why is no real title available?)
• Deadlock-free interval routing schemes
• Suboptimal-optimal routing for LAN internetworking using transparent bridges
• Interval routing schemes
• Multi-dimensional Interval Routing Schemes
• On multi-label linear interval routing schemes
• Topological routing schemes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3815249)