Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms

Sebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai. Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. In Shuchi Chawla 0001, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020. pages 2046-2065, SIAM, 2020. [doi]

@inproceedings{ForsterNYSY20,
  title = {Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms},
  author = {Sebastian Forster and Danupon Nanongkai and Liu Yang and Thatchaphol Saranurak and Sorrachai Yingchareonthawornchai},
  year = {2020},
  doi = {10.1137/1.9781611975994.126},
  url = {https://doi.org/10.1137/1.9781611975994.126},
  researchr = {https://researchr.org/publication/ForsterNYSY20},
  cites = {0},
  citedby = {0},
  pages = {2046-2065},
  booktitle = {Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020},
  editor = {Shuchi Chawla 0001},
  publisher = {SIAM},
  isbn = {978-1-61197-599-4},
}