Minimum Cuts in Directed Graphs via \(\surd\)n Max-Flows. Cen, R., Li, J., Nanongkai, D., Panigrahi, D., & Saranurak, T. CoRR, 2021.
Minimum Cuts in Directed Graphs via \(\surd\)n Max-Flows [link]Paper  bibtex   
@article{DBLP:journals/corr/abs-2104-07898,
  author    = {Ruoxu Cen and
               Jason Li and
               Danupon Nanongkai and
               Debmalya Panigrahi and
               Thatchaphol Saranurak},
  title     = {Minimum Cuts in Directed Graphs via {\(\surd\)}n Max-Flows},
  journal   = {CoRR},
  volume    = {abs/2104.07898},
  year      = {2021},
  url       = {https://arxiv.org/abs/2104.07898},
  archivePrefix = {arXiv},
  eprint    = {2104.07898},
  timestamp = {Mon, 19 Apr 2021 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2104-07898.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0