Constructing near spanning trees with few local inspections

  • Levi R
  • Moshkovitz G
  • Ron D
 et al. 
  • 9


    Mendeley users who have this article in their library.
  • 3


    Citations of this article.


Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. Motivated by several recent studies of local graph algorithms, we consider the following variant of this problem. Let G be a connected bounded-degree graph. Given an edge $e$ in $G$ we would like to decide whether $e$ belongs to a connected subgraph $G'$ consisting of $(1+\epsilon)n$ edges (for a prespecified constant $\epsilon >0$), where the decision for different edges should be consistent with the same subgraph $G'$. Can this task be performed by inspecting only a {\em constant} number of edges in $G$? Our main results are: (1) We show that if every $t$-vertex subgraph of $G$ has expansion $1/(\log t)^{1+o(1)}$ then one can (deterministically) construct a sparse spanning subgraph $G'$ of $G$ using few inspections. To this end we analyze a "local" version of a famous minimum-weight spanning tree algorithm. (2) We show that the above expansion requirement is sharp even when allowing randomization. To this end we construct a family of $3$-regular graphs of high girth, in which every $t$-vertex subgraph has expansion $1/(\log t)^{1-o(1)}$.

Author-supplied keywords

  • graph expansion
  • local algorithms
  • sparse spanning graph

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Reut Levi

  • Guy Moshkovitz

  • Dana Ron

  • Ronitt Rubinfeld

  • Asaf Shapira

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free