𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Monotonicity testing and shortest-path routing on the cube

✍ Scribed by Jop Briët, Sourav Chakraborty, David García-Soriano, Arie Matsliah

Book ID
113046146
Publisher
Springer-Verlag
Year
2012
Tongue
English
Weight
268 KB
Volume
32
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest path routing and fault-tolerant
Shortest path routing and fault-tolerant routing on de Bruijn networks
✍ Mao, Jyh-Wen; Yang, Chang-Biau 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 170 KB 👁 1 views

In this paper, we study the routing problem for the undirected binary de Bruijn interconnection network. Researchers have never proposed a shortest path routing algorithm on the undirected binary de Bruijn network. We first propose a shortest path routing algorithm, whose time complexity in the bina

The complexity of shortest path and dila
The complexity of shortest path and dilation bounded interval routing
✍ Rastislav Kráľovič; Peter Ružička; Daniel Štefankovič 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 227 KB

Interval routing is a popular compact routing method for point-to-point networks which found industrial applications in novel transputer routing technology (May and Thompson, Transputers and Routers: Components for Concurrent Machines, Inmos, 1991). Recently much e ort is devoted to relate the e ci