Minimum Cuts in Directed Graphs via Partial Sparsification

Cen, Ruoxu; Li, Jason; Nanongkai, Danupon; Panigrahi, Debmalya; Quanrud, Kent; Saranurak, Thatchaphol

doi:10.1109/FOCS52979.2021.00113

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Minimum Cuts in Directed Graphs via Partial Sparsification

MPS-Authors

There are no MPG-Authors in the publication available

External Resource

Link
(Any fulltext)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Cen, R., Li, J., Nanongkai, D., Panigrahi, D., Quanrud, K., & Saranurak, T. (2021). Minimum Cuts in Directed Graphs via Partial Sparsification. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (pp. 1147-1158). Piscatawayn, NJ: IEEE.

Cite as: https://hdl.handle.net/21.11116/0000-000E-6CE3-9

Abstract

There is no abstract available