Finding a Small Vertex Cut on Distributed Networks

Jiang, Yonggang; Mukhopadhyay, Sagnik

doi:10.1145/3564246.3585201

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Finding a Small Vertex Cut on Distributed Networks

MPS-Authors

/persons/resource/persons284876

Jiang, Yonggang
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

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

Fulltext (public)

3564246.3585201.pdf
(Publisher version), 466KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Jiang, Y., & Mukhopadhyay, S. (2023). Finding a Small Vertex Cut on Distributed Networks. In STOC '23 (pp. 1791-1801). New York, NY: ACM. doi:10.1145/3564246.3585201.

Cite as: https://hdl.handle.net/21.11116/0000-000C-947A-4

Abstract

There is no abstract available