Distributed weighted min-cut in nearly-optimal time

Dory, M., Efron, Y., Mukhopadhyay, S. orcid.org/0000-0002-3722-4679 et al. (1 more author) (2021) Distributed weighted min-cut in nearly-optimal time. In: Khuller, S., (ed.) STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 21-25 Jun 2021, Virtual Italy. Association for Computing Machinery (ACM) , pp. 1144-1153. ISBN 9781450380539

Abstract

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Editors:
  • Khuller, S.
Copyright, Publisher and Additional Information:

© 2021 ACM. This is an author-produced version of a paper subsequently published in STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Uploaded in accordance with the publisher's self-archiving policy.

Keywords: CONGEST model; Minimun-cut
Dates:
  • Published: 15 June 2021
  • Published (online): 15 June 2021
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 28 Jun 2023 13:59
Last Modified: 29 Jun 2023 13:25
Status: Published
Publisher: Association for Computing Machinery (ACM)
Refereed: Yes
Identification Number: 10.1145/3406325.3451020
Related URLs:
Open Archives Initiative ID (OAI ID):

Export

Statistics