Corpus ID: 118633876

A Faster Local Algorithm for Detecting Bounded-Size Cuts with Applications to Higher-Connectivity Problems

@article{Forster2019AFL,
  title={A Faster Local Algorithm for Detecting Bounded-Size Cuts with Applications to Higher-Connectivity Problems},
  author={Sebastian Forster and Liu Yang},
  journal={ArXiv},
  year={2019},
  volume={abs/1904.08382}
}
  • Sebastian Forster, Liu Yang
  • Published in ArXiv 2019
  • Mathematics, Computer Science
  • Consider the following "local" cut-detection problem in a directed graph: We are given a starting vertex $s$ and need to detect whether there is a cut with at most $k$ edges crossing the cut such that the side of the cut containing $s$ has at most $\Delta$ interior edges. If we are given query access to the input graph, then this problem can in principle be solved in sublinear time without reading the whole graph and with query complexity depending on $k$ and $\Delta$. We design an elegant… CONTINUE READING

    References

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

    Breaking quadratic time for small vertex connectivity. https://youtu.be/V1kq1filhjk, 2019

    • Thatchaphol Saranurak
    • 2019

    A (Centralized) Local Guide

    On Fully Dynamic Graph Sparsifiers