𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A shortest path metric on unlabeled binary trees

✍ Scribed by André Bonnin; Jean-Marcel Pallo

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
298 KB
Volume
13
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A scalable multicast routing protocol fo
A scalable multicast routing protocol for building shortest path trees
✍ Baoxian Zhang; Jun Zheng; Hussein T. Mouftah 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB 👁 1 views

## Abstract Scalability is a great concern in the design of multicast routing protocols for the global Internet. Building shortest path trees (SPT) is currently one of the most widely used approaches to supporting multicast routing because of the simplicity and low per‐destination cost of such tree

A note on k-shortest paths problem
A note on k-shortest paths problem
✍ Nick Gravin; Ning Chen 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 66 KB 👁 1 views

It is well-known that in a directed graph, if deleting any edge will not affect the shortest distance between two specific vertices s and t, then there are two edge-disjoint paths from s to t and both of them are shortest paths. In this article, we generalize this to shortest k edgedisjoint s-t path