Local Algorithms for Sparse Spanning Graphs

@inproceedings{Levi2014LocalAF,
  title={Local Algorithms for Sparse Spanning Graphs},
  author={Reut Levi and Dana Ron and Ronitt Rubinfeld},
  booktitle={APPROX-RANDOM},
  year={2014}
}
  • Reut Levi, Dana Ron, Ronitt Rubinfeld
  • Published in APPROX-RANDOM 2014
  • Mathematics, Computer Science
  • 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 by $(1+\epsilon)|V|$ for a given parameter $\epsilon > 0$. To this end the algorithms may query the incidence relation of the graph $G$, and we seek algorithms whose query complexity and running time (per… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    1
    Twitter Mention

    Citations

    Publications citing this paper.
    SHOWING 1-7 OF 7 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 50 REFERENCES