A Local Algorithm for Constructing Spanners in Minor-Free Graphs
Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. We consider this problem in the setting of local algorithms: one wants to quickly determine whether a given edge e is in a specific spanning tree, without computing the whole spanning tree, but rather by inspecti...
Main Authors: | Levi, Reut, Ron, Dana, Rubinfeld, Ronitt |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Dagstuhl Publishing
2017
|
Online Access: | http://hdl.handle.net/1721.1/111969 https://orcid.org/0000-0002-4353-7639 |
Similar Items
-
Local Algorithms for Sparse Spanning Graphs
by: Levi, Reut, et al.
Published: (2016) -
Local Algorithms for Sparse Spanning Graphs
by: Levi, Reut, et al.
Published: (2021) -
Local computation algorithms for spanners
by: Parter, Merav, et al.
Published: (2022) -
Local Computation Algorithms for Graphs of Non-constant Degrees
by: Levi, Reut, et al.
Published: (2022) -
Local Computation Algorithms for Graphs of Non-constant Degrees
by: Levi, Reut, et al.
Published: (2021)