Local Algorithms for Sparse Spanning Graphs
We initiate the study of the problem of designing sublinear-time (local) algorithms that, given an edge (u,v) in a connected graph G = (V,E), decide whether (u,v) belongs to a sparse spanning graph G' = (V,E') of G. Namely, G' should be connected and |E'| should be upper bounded...
| Main Authors: | , , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Schloss Dagstuhl,
2016-01-29T01:32:56Z.
|
| Subjects: | |
| Online Access: | Get fulltext |