Stochastic Embeddings of Graphs into Trees
From MaRDI portal
Abstract: It is known that every graph with n vertices embeds stochastically into trees with distortion . In this paper, we show that this upper bound is sharp for a large class of graphs. As this class of graphs contains diamond graphs, this result extends known examples that obtain this largest possible stochastic distortion.
This page was built for publication: Stochastic Embeddings of Graphs into Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6439842)
