@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}
}

{"_id":"Dk7xgwakYwzr2TsxD","bibbaseid":"cen-li-nanongkai-panigrahi-saranurak-minimumcutsindirectedgraphsviasurdnmaxflows-2021","author_short":["Cen, R.","Li, J.","Nanongkai, D.","Panigrahi, D.","Saranurak, T."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Ruoxu"],"propositions":[],"lastnames":["Cen"],"suffixes":[]},{"firstnames":["Jason"],"propositions":[],"lastnames":["Li"],"suffixes":[]},{"firstnames":["Danupon"],"propositions":[],"lastnames":["Nanongkai"],"suffixes":[]},{"firstnames":["Debmalya"],"propositions":[],"lastnames":["Panigrahi"],"suffixes":[]},{"firstnames":["Thatchaphol"],"propositions":[],"lastnames":["Saranurak"],"suffixes":[]}],"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","bibtex":"@article{DBLP:journals/corr/abs-2104-07898,\n author = {Ruoxu Cen and\n Jason Li and\n Danupon Nanongkai and\n Debmalya Panigrahi and\n Thatchaphol Saranurak},\n title = {Minimum Cuts in Directed Graphs via {\\(\\surd\\)}n Max-Flows},\n journal = {CoRR},\n volume = {abs/2104.07898},\n year = {2021},\n url = {https://arxiv.org/abs/2104.07898},\n archivePrefix = {arXiv},\n eprint = {2104.07898},\n timestamp = {Mon, 19 Apr 2021 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-2104-07898.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Cen, R.","Li, J.","Nanongkai, D.","Panigrahi, D.","Saranurak, T."],"key":"DBLP:journals/corr/abs-2104-07898","id":"DBLP:journals/corr/abs-2104-07898","bibbaseid":"cen-li-nanongkai-panigrahi-saranurak-minimumcutsindirectedgraphsviasurdnmaxflows-2021","role":"author","urls":{"Paper":"https://arxiv.org/abs/2104.07898"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://dblp.org/pid/123/4694.bib","dataSources":["aRHngFmcNsyNxZ9Rj"],"keywords":[],"search_terms":["minimum","cuts","directed","graphs","via","surd","max","flows","cen","li","nanongkai","panigrahi","saranurak"],"title":"Minimum Cuts in Directed Graphs via \\(\\surd\\)n Max-Flows","year":2021}