# Low-stretch spanning trees of graphs with bounded width

We study the problem of low-stretch spanning trees in graphs of bounded width: bandwidth, cutwidth, and treewidth. We show that any simple connected graph G with a linear arrangement of bandwidth b can be embedded into a distribution 𝒯 of spanning trees such that the expected stretch of each edge of G is O(b^2). Our proof implies a linear time algorithm for sampling from 𝒯. Therefore, we have a linear time algorithm that finds a spanning tree of G with average stretch O(b^2) with high probability. We also describe a deterministic linear-time algorithm for computing a spanning tree of G with average stretch O(b^3). For graphs of cutwidth c, we construct a spanning tree with stretch O(c^2) in linear time. Finally, when G has treewidth k we provide a dynamic programming algorithm computing a minimum stretch spanning tree of G that runs in polynomial time with respect to the number of vertices of G.

• 8 publications
• 11 publications
• 67 publications
• 6 publications
• 13 publications
research
06/12/2018

### Drawing a Rooted Tree as a Rooted y-Monotone Minimum Spanning Tree

Given a rooted point set P, the rooted y-Monotone Minimum Spanning Tree ...
research
12/26/2017

### Near-linear Time Algorithms for Approximate Minimum Degree Spanning Trees

Given a graph G = (V, E), n=|V|, m=|E|, we wish to compute a spanning tr...
research
11/17/2017

### An almost-linear time algorithm for uniform random spanning tree generation

We give an m^1+o(1)β^o(1)-time algorithm for generating a uniformly rand...
research
08/15/2018

### Edge Disjoint Spanning Trees in an Undirected Graph with E=2(V-1)

Given a connected undirected graph G = [V; E] where |E| =2(|V| -1), we p...
research
02/21/2018

### Spanning Tree Congestion and Computation of Generalized Győri-Lovász Partition

We study a natural problem in graph sparsification, the Spanning Tree Co...
research
02/15/2017

### Linear Time Computation of Moments in Sum-Product Networks

Bayesian online algorithms for Sum-Product Networks (SPNs) need to updat...
research
03/24/2023

### Sharp threshold for embedding balanced spanning trees in random geometric graphs

A rooted tree is balanced if the degree of a vertex depends only on its ...