Congested clique algorithms for the minimum cut problem

Ghaffari, Mohsen; Nowicki, Krzysztof

Przejdź do menu głównego Przejdź do wyszukiwarki Przejdź do zawartości

polski
English

Home page
Congested clique algorithms for the minimum cut problem

Description

Title: Congested clique algorithms for the minimum cut problem
Collective work title: PODC'18 : proceedings of the 2018 ACM Symposium on Principles of Distributed Computing : July 23-27, 2018, Egham, United Kingdom
Creator: Ghaffari, Mohsen ; Nowicki, Krzysztof
Pages: S. 357-366
Publisher: ACM
Place of publishing: New York
Date issued: 2018
Type: Tekst
Identifier: ISBN 9781450357951 ; https://doi.org/10.1145/3212734.3212750
Language: eng
Has version: https://doi.org/10.1145/3212734.3212750
Detailed object type: rozdz
Object type: Rozdział

The build of the Digital Demonstration Library was commissioned by the Name of the Institution of the Foundation's Institution. The Name of the Foundation under the Program, the Library Project and its creation under the patronage of the Name of the Institution.

Europejski Fundusz Rozwoju Regionalnego Unii Europejskiej

The project titled "Workflow to develop digital publications at the university" co-financed by the European Union from the European Regional Development Fund.

We use files, through the cookie quality improvement layer of our website.For more information, please read the document Privacy Policy