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...
Main Authors: | , , , , |
---|---|
Other Authors: | , |
Format: | Article |
Language: | English |
Published: |
Wiley Blackwell,
2017-05-16T19:56:01Z.
|
Subjects: | |
Online Access: | Get fulltext |