Constructing near spanning trees with few local inspections

Constructing near spanning trees with few local inspections

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...

Full description

Bibliographic Details
Main Authors: Levi, Reut (Author), Moshkovitz, Guy (Author), Ron, Dana (Author), Shapira, Asaf (Author), Rubinfeld, Ronitt (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Wiley Blackwell, 2017-05-16T19:56:01Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items