scientific article

zbMath0586.68056MaRDI QIDQ3711761

Jan van Leeuwen, Richard B. Tan

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

routing messages in arbitrary networkssmall amount of information

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Deadlock-free interval routing schemes, Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems, All-shortest-path 2-interval routing is NP-complete, Searching among intervals and compact routing tables, Designing networks with compact routing tables, Searching among intervals and compact routing tables, Average stretch analysis of compact routing schemes, On interval routing schemes and treewidth, On devising Boolean Routing Schemes, On devising Boolean Routing schemes, On multi-label linear interval routing schemes, Compact and localized distributed data structures, On the hardness of minimizing space for all-shortest-path interval routing schemes, Efficient parallel algorithms for shortest paths in planar digraphs, Representing graphs implicitly using almost optimal space, Interval routing schemes, Multidimensional interval routing schemes, Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems, The compactness of adaptive routing tables, A survey on interval routing, The complexity of the characterization of networks supporting shortest-path interval routing., Static and dynamic low-congested interval routing schemes, Graph theoretical issues in computer networks