𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs

✍ Scribed by Y. Rabinovich; R. Raz


Publisher
Springer
Year
1998
Tongue
English
Weight
176 KB
Volume
19
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Lower bounds on the lengths of node sequ
✍ George Markowsky; Robert Endre Tarjan πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 353 KB

A strong node sequence for a directed graph G = (N, A) is a sequence of nodes containing every cycle-free path of G as a subsequence. A weak node sequence for G is a sequence of nodes containing every basic path in G as a subsequence, where a basic path nt, n~ ..... nj, is a path from Ilt to nk such